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-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:49:30,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:49:31,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:49:31,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:49:31,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:49:31,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:49:31,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:49:31,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:49:31,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:49:31,025 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:49:31,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:49:31,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:49:31,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:49:31,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:49:31,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:49:31,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:49:31,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:49:31,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:49:31,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:49:31,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:49:31,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:49:31,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:49:31,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:49:31,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:49:31,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:49:31,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:49:31,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:49:31,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:49:31,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:49:31,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:49:31,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:49:31,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:49:31,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:49:31,047 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:49:31,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:49:31,048 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:49:31,048 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:49:31,060 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:49:31,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:49:31,061 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:49:31,062 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:49:31,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:49:31,062 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:49:31,062 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:49:31,062 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:49:31,063 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:49:31,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:49:31,063 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:49:31,063 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:49:31,063 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:49:31,064 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:49:31,064 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:49:31,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:49:31,065 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:49:31,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:49:31,065 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:49:31,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:49:31,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:49:31,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:49:31,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:49:31,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:49:31,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:49:31,066 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:49:31,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:49:31,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:49:31,067 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:49:31,067 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:49:31,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:49:31,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:49:31,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:49:31,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:49:31,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:49:31,069 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:49:31,069 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:49:31,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:49:31,069 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:49:31,069 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:49:31,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:49:31,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:49:31,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:49:31,137 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:49:31,138 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:49:31,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-02-15 10:49:31,139 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-02-15 10:49:31,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:49:31,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:49:31,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:49:31,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:49:31,187 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:49:31,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:49:31,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:49:31,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:49:31,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:49:31,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... [2019-02-15 10:49:31,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:49:31,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:49:31,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:49:31,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:49:31,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:49:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:49:31,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:49:31,554 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:49:31,554 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-15 10:49:31,556 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:31 BoogieIcfgContainer [2019-02-15 10:49:31,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:49:31,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:49:31,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:49:31,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:49:31,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:31" (1/2) ... [2019-02-15 10:49:31,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d0009 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:31, skipping insertion in model container [2019-02-15 10:49:31,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:31" (2/2) ... [2019-02-15 10:49:31,564 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-02-15 10:49:31,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:49:31,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-15 10:49:31,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-15 10:49:31,631 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:49:31,632 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:49:31,632 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:49:31,632 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:49:31,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:49:31,632 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:49:31,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:49:31,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:49:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-15 10:49:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:49:31,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:31,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:49:31,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-15 10:49:31,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:31,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:31,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:31,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:49:31,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:49:31,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:31,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:49:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:49:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:31,954 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-15 10:49:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:32,297 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-15 10:49:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:32,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:49:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:32,312 INFO L225 Difference]: With dead ends: 21 [2019-02-15 10:49:32,313 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 10:49:32,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 10:49:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-15 10:49:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 10:49:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-15 10:49:32,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-15 10:49:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:32,354 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-15 10:49:32,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:49:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-15 10:49:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:49:32,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:32,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:49:32,356 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-15 10:49:32,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:32,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:32,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:32,714 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-15 10:49:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:32,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:32,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:32,768 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:49:32,770 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-15 10:49:32,802 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:32,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:32,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:32,890 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 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-02-15 10:49:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:32,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:32,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:32,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:32,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:32,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:32,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:32,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 15 treesize of output 18 [2019-02-15 10:49:32,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:32,995 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 18 treesize of output 24 [2019-02-15 10:49:33,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:49:33,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,105 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 22 treesize of output 45 [2019-02-15 10:49:33,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:33,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:33,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:33,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:33,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-02-15 10:49:33,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:33,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:33,500 INFO L303 Elim1Store]: Index analysis took 165 ms [2019-02-15 10:49:33,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:33,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:33,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:33,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:33,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:33,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:33,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:49:33,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:33,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:49:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:49:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:33,795 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-15 10:49:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:34,133 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-15 10:49:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:49:34,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:49:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:34,135 INFO L225 Difference]: With dead ends: 31 [2019-02-15 10:49:34,135 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 10:49:34,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:49:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 10:49:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-15 10:49:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:49:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-15 10:49:34,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-15 10:49:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:34,143 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-15 10:49:34,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:49:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-15 10:49:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:49:34,144 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:34,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:49:34,144 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:34,145 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-15 10:49:34,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:34,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:34,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:34,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:34,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:34,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:49:34,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:49:34,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:34,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:49:34,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:49:34,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:34,183 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-15 10:49:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:34,232 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-15 10:49:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:34,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:49:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:34,233 INFO L225 Difference]: With dead ends: 15 [2019-02-15 10:49:34,233 INFO L226 Difference]: Without dead ends: 14 [2019-02-15 10:49:34,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-15 10:49:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-15 10:49:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:49:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-15 10:49:34,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-15 10:49:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:34,239 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-15 10:49:34,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:49:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-15 10:49:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:49:34,240 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:34,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:49:34,240 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:34,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-15 10:49:34,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:34,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:34,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:34,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:34,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:34,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:34,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:49:34,310 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-15 10:49:34,315 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:34,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:34,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:34,325 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 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-02-15 10:49:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:34,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:34,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:34,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:34,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:34,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:34,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:34,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,401 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 18 treesize of output 24 [2019-02-15 10:49:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,457 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 20 treesize of output 34 [2019-02-15 10:49:34,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,543 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 22 treesize of output 45 [2019-02-15 10:49:34,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:34,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:34,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:34,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:34,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:34,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:34,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:34,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:34,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:34,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:34,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:34,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:49:34,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:49:34,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:34,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:49:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:49:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:34,981 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-15 10:49:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:35,088 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-15 10:49:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:49:35,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:49:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:35,089 INFO L225 Difference]: With dead ends: 18 [2019-02-15 10:49:35,089 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:49:35,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:49:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-15 10:49:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:49:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-15 10:49:35,096 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-15 10:49:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:35,097 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-15 10:49:35,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:49:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-15 10:49:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:49:35,098 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:35,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:49:35,098 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-15 10:49:35,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:35,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:35,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:35,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:35,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:35,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:35,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:49:35,194 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-15 10:49:35,196 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:35,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:35,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:35,279 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 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-02-15 10:49:35,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:35,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:35,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:35,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:35,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:35,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:35,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:35,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:35,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,314 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 18 treesize of output 24 [2019-02-15 10:49:35,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,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 20 treesize of output 34 [2019-02-15 10:49:35,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:35,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:35,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:35,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:35,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:35,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:35,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:35,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:35,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:49:35,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:35,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:49:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:49:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:35,612 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-15 10:49:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:35,795 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-15 10:49:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:49:35,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:49:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:35,798 INFO L225 Difference]: With dead ends: 32 [2019-02-15 10:49:35,798 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 10:49:35,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:49:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 10:49:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-15 10:49:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 10:49:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-15 10:49:35,805 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-15 10:49:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:35,805 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-15 10:49:35,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:49:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-15 10:49:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:35,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:35,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:35,806 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:35,807 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-15 10:49:35,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:35,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:35,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:35,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:35,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:35,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:35,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:35,862 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-15 10:49:35,863 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:35,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:35,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:35,872 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:35,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:35,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:35,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:35,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:35,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:35,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:35,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:35,908 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 18 treesize of output 20 [2019-02-15 10:49:35,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,924 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 20 treesize of output 26 [2019-02-15 10:49:35,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:35,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:49:35,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:35,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:36,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-15 10:49:36,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:49:36,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,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-02-15 10:49:36,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:49:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:36,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:36,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:49:36,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:49:36,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:36,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:49:36,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:49:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:36,194 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-15 10:49:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:36,233 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-15 10:49:36,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:36,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:49:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:36,234 INFO L225 Difference]: With dead ends: 22 [2019-02-15 10:49:36,235 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 10:49:36,235 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-02-15 10:49:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 10:49:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-15 10:49:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 10:49:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-15 10:49:36,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-15 10:49:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:36,241 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-15 10:49:36,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:49:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-15 10:49:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:36,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:36,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:36,242 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:36,242 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-15 10:49:36,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:36,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:36,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:36,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:36,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:36,346 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:36,346 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-15 10:49:36,349 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:36,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:36,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:36,355 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:36,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:36,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:36,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:36,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:36,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:36,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:36,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:36,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,398 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 18 treesize of output 24 [2019-02-15 10:49:36,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,409 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 20 treesize of output 34 [2019-02-15 10:49:36,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:36,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,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-02-15 10:49:36,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:36,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:36,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:36,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:36,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:36,631 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:36,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:49:36,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:36,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:36,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:49:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:36,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:36,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:36,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:36,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:36,814 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-15 10:49:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:37,109 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-15 10:49:37,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:37,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:49:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:37,112 INFO L225 Difference]: With dead ends: 37 [2019-02-15 10:49:37,112 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 10:49:37,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 10:49:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-15 10:49:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:49:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-15 10:49:37,118 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-15 10:49:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:37,119 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-15 10:49:37,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-15 10:49:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:37,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:37,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:37,120 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-15 10:49:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:37,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:37,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:37,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:37,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:37,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:37,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:37,269 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:37,269 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-15 10:49:37,272 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:37,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:37,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:37,280 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:37,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:37,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:37,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:37,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:37,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:37,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:37,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,317 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 18 treesize of output 24 [2019-02-15 10:49:37,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:49:37,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,341 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 22 treesize of output 45 [2019-02-15 10:49:37,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:37,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:37,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:37,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:37,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:37,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:37,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,602 INFO L303 Elim1Store]: Index analysis took 181 ms [2019-02-15 10:49:37,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:37,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:37,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:37,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:37,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:37,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:49:37,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:37,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:37,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:37,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:37,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:37,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:37,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:37,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:37,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:37,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:37,983 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-15 10:49:38,243 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-02-15 10:49:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:38,439 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-02-15 10:49:38,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:38,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:49:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:38,441 INFO L225 Difference]: With dead ends: 42 [2019-02-15 10:49:38,442 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 10:49:38,442 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-02-15 10:49:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 10:49:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-02-15 10:49:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 10:49:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-02-15 10:49:38,451 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-02-15 10:49:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:38,452 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-02-15 10:49:38,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-02-15 10:49:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:38,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:38,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:38,453 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:38,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:38,453 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-15 10:49:38,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:38,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:38,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:38,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:38,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:38,535 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:38,535 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-15 10:49:38,537 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:38,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:38,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:38,543 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:38,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:38,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:38,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:38,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:38,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:38,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:38,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:38,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,576 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 18 treesize of output 24 [2019-02-15 10:49:38,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,586 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 20 treesize of output 34 [2019-02-15 10:49:38,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,598 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 22 treesize of output 45 [2019-02-15 10:49:38,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:38,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:38,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:38,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:38,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:38,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:38,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:38,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:38,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:38,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:38,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:49:38,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:38,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:38,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:38,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:38,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:38,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:38,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:38,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:38,950 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-02-15 10:49:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:39,320 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-02-15 10:49:39,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:39,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:49:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:39,322 INFO L225 Difference]: With dead ends: 51 [2019-02-15 10:49:39,322 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 10:49:39,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:49:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 10:49:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-02-15 10:49:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 10:49:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-02-15 10:49:39,333 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-02-15 10:49:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:39,333 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-02-15 10:49:39,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-02-15 10:49:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:39,334 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:39,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:39,334 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:39,335 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-15 10:49:39,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:39,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:39,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:39,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:39,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:39,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:39,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:39,393 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-15 10:49:39,394 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:39,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:39,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:39,399 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:39,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:39,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:39,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:39,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:39,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:39,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:39,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:39,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:49:39,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,450 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 20 treesize of output 34 [2019-02-15 10:49:39,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:39,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:39,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:39,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:39,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:39,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-02-15 10:49:39,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:39,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:39,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:39,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:39,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:39,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:39,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:39,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:39,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:49:39,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:39,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:49:39,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:49:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:39,684 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-02-15 10:49:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:39,884 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-02-15 10:49:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:49:39,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:49:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:39,886 INFO L225 Difference]: With dead ends: 36 [2019-02-15 10:49:39,886 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:49:39,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:49:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:49:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-02-15 10:49:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:49:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-02-15 10:49:39,894 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-02-15 10:49:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:39,895 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-02-15 10:49:39,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:49:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-02-15 10:49:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:39,895 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:39,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:39,896 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:39,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-02-15 10:49:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:39,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:39,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:39,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:39,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:39,976 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:39,976 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-02-15 10:49:39,977 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:39,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:39,983 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:39,983 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:39,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:39,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:39,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:39,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:39,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:39,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:40,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:40,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:40,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:49:40,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,056 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 20 treesize of output 34 [2019-02-15 10:49:40,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:40,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,105 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:40,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:40,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:40,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,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-02-15 10:49:40,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:40,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:49:40,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:40,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:40,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:40,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:40,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:40,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:40,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:40,333 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-02-15 10:49:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:40,757 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-02-15 10:49:40,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:40,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:49:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:40,759 INFO L225 Difference]: With dead ends: 55 [2019-02-15 10:49:40,759 INFO L226 Difference]: Without dead ends: 54 [2019-02-15 10:49:40,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:49:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-15 10:49:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-02-15 10:49:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 10:49:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-02-15 10:49:40,770 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-02-15 10:49:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:40,770 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-02-15 10:49:40,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-02-15 10:49:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:40,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:40,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:40,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:40,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-15 10:49:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:40,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:40,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-02-15 10:49:40,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:40,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:40,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:40,864 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-15 10:49:40,866 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:40,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:40,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:40,871 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:40,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:40,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:40,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:40,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:40,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:40,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:40,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:40,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,904 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 18 treesize of output 24 [2019-02-15 10:49:40,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,910 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 20 treesize of output 34 [2019-02-15 10:49:40,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,923 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 22 treesize of output 45 [2019-02-15 10:49:40,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:40,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:40,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:40,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:41,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:41,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:41,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:41,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:49:41,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:41,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:41,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:41,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:41,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:41,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:41,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:41,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:41,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:41,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:41,199 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-02-15 10:49:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:41,682 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-02-15 10:49:41,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:41,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:49:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:41,684 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:49:41,684 INFO L226 Difference]: Without dead ends: 54 [2019-02-15 10:49:41,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-15 10:49:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-02-15 10:49:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 10:49:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-02-15 10:49:41,695 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-02-15 10:49:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:41,695 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-02-15 10:49:41,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-02-15 10:49:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:41,696 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:41,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:41,697 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-15 10:49:41,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:41,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:41,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:41,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:41,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:41,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:41,770 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-15 10:49:41,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:41,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:41,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:41,776 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-15 10:49:41,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:41,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:41,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:41,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:41,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:41,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:41,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:41,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:41,801 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 18 treesize of output 20 [2019-02-15 10:49:41,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-02-15 10:49:41,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:49:41,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:41,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:41,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:41,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:41,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:41,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-15 10:49:41,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:41,963 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-02-15 10:49:41,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:42,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:42,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:49:42,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-02-15 10:49:42,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:42,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:42,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:49:42,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:42,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:49:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:49:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:42,062 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-02-15 10:49:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:42,201 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-02-15 10:49:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:49:42,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:49:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:42,203 INFO L225 Difference]: With dead ends: 48 [2019-02-15 10:49:42,203 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 10:49:42,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:49:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 10:49:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-02-15 10:49:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 10:49:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-02-15 10:49:42,212 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-02-15 10:49:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:42,213 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-02-15 10:49:42,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:49:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-02-15 10:49:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:42,214 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:42,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:42,214 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-15 10:49:42,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:42,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:42,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:49:42,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:42,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:42,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:42,312 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-15 10:49:42,313 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:42,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:42,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:42,317 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:42,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:42,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:42,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:42,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:42,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:42,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:42,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:42,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:49:42,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:49:42,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:42,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:42,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:42,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:42,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:42,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:42,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:42,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:42,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:42,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:42,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:42,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:42,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, 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-02-15 10:49:42,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:42,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:42,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:42,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:42,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:42,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:42,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:42,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:42,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:42,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:42,720 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-02-15 10:49:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:43,011 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-02-15 10:49:43,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:43,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:43,013 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:49:43,013 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:49:43,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:49:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-02-15 10:49:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 10:49:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-02-15 10:49:43,022 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-02-15 10:49:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:43,022 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-02-15 10:49:43,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-02-15 10:49:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:43,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:43,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:43,023 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-02-15 10:49:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:43,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:43,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:43,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:43,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:43,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:43,228 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-15 10:49:43,228 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:43,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:43,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:43,232 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:43,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:43,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:43,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:43,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:43,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:43,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:43,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:43,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,265 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 18 treesize of output 24 [2019-02-15 10:49:43,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,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 20 treesize of output 34 [2019-02-15 10:49:43,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:43,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:43,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:43,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:43,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:43,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:43,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:43,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:43,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:43,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:43,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:49:43,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:43,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:43,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:43,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,543 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:43,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:43,545 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-02-15 10:49:43,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:43,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:43,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:49:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:43,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:43,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:43,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:49:43,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:43,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:43,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:43,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:49:43,653 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-02-15 10:49:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:44,187 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-02-15 10:49:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:49:44,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:49:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:44,189 INFO L225 Difference]: With dead ends: 76 [2019-02-15 10:49:44,189 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 10:49:44,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:49:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 10:49:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-02-15 10:49:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:49:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-15 10:49:44,202 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-15 10:49:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:44,202 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-15 10:49:44,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-15 10:49:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:44,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:44,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:44,203 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-15 10:49:44,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:44,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:44,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:44,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:44,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:44,385 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-15 10:49:44,386 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:44,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:44,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:44,390 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:44,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:44,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:44,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:44,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:44,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:44,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:44,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:44,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,416 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 18 treesize of output 24 [2019-02-15 10:49:44,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:49:44,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:44,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:44,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:44,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:44,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:44,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:44,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:44,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:44,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:44,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:44,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:44,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,654 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:44,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:49:44,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:44,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:44,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:49:44,913 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-15 10:49:44,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:44,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:45,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:45,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:45,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:45,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:45,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:45,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:45,150 INFO L303 Elim1Store]: Index analysis took 232 ms [2019-02-15 10:49:45,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:49:45,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:45,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:45,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:49:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:45,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:49:45,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:45,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:49:45,669 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-02-15 10:49:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:46,222 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-02-15 10:49:46,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:46,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:49:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:46,224 INFO L225 Difference]: With dead ends: 67 [2019-02-15 10:49:46,224 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:49:46,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:49:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:49:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-02-15 10:49:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 10:49:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-02-15 10:49:46,236 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-02-15 10:49:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:46,237 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-02-15 10:49:46,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-02-15 10:49:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:46,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:46,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:46,238 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-15 10:49:46,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:46,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:46,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:46,407 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-15 10:49:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:46,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:46,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:46,434 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:46,434 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-15 10:49:46,439 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:46,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:46,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:46,447 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:46,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:46,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:46,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:46,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:46,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:46,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:46,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:46,533 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 18 treesize of output 20 [2019-02-15 10:49:46,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,539 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 20 treesize of output 26 [2019-02-15 10:49:46,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:49:46,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:46,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-15 10:49:46,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,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, 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-02-15 10:49:46,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:46,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:49:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:46,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 10:49:46,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:46,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:49:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:46,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:46,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:46,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:46,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:46,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:46,755 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-02-15 10:49:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:46,960 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-02-15 10:49:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:46,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:46,962 INFO L225 Difference]: With dead ends: 58 [2019-02-15 10:49:46,962 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:49:46,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:49:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-02-15 10:49:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:49:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-15 10:49:46,973 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-15 10:49:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:46,974 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-15 10:49:46,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-15 10:49:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:46,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:46,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:46,975 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-02-15 10:49:46,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:46,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:46,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:47,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:47,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:47,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:47,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:47,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:47,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:47,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:47,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:47,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:49:47,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:47,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:47,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:47,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,174 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 18 treesize of output 24 [2019-02-15 10:49:47,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,180 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 20 treesize of output 34 [2019-02-15 10:49:47,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:47,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:47,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:47,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:47,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:47,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:47,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:47,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:47,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:47,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:47,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:47,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:49:47,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:47,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:47,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:47,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,447 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:47,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:47,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:49:47,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:47,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:47,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:49:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:47,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:47,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:47,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:49:47,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:47,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:47,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:49:47,566 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-02-15 10:49:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:47,960 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-02-15 10:49:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:49:47,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:49:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:47,968 INFO L225 Difference]: With dead ends: 71 [2019-02-15 10:49:47,968 INFO L226 Difference]: Without dead ends: 70 [2019-02-15 10:49:47,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:49:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-15 10:49:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-02-15 10:49:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:49:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-15 10:49:47,980 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-02-15 10:49:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:47,980 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-15 10:49:47,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-15 10:49:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:47,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:47,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:47,981 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-15 10:49:47,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:47,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:47,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:47,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:49:48,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:49:48,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:49:48,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:48,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:49:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:49:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:49:48,070 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-02-15 10:49:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:48,360 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-02-15 10:49:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:48,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:49:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:48,361 INFO L225 Difference]: With dead ends: 36 [2019-02-15 10:49:48,361 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 10:49:48,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:49:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 10:49:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-02-15 10:49:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:49:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-02-15 10:49:48,371 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-02-15 10:49:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:48,371 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-02-15 10:49:48,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:49:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-02-15 10:49:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:48,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:48,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:48,373 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-15 10:49:48,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:48,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:48,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:48,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:48,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:48,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:48,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:48,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:48,480 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-15 10:49:48,481 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:48,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:48,484 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:48,484 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:48,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:48,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:48,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:48,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:48,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:48,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:48,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,507 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 18 treesize of output 24 [2019-02-15 10:49:48,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,524 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 20 treesize of output 34 [2019-02-15 10:49:48,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:48,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:48,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:48,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:48,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:48,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-02-15 10:49:48,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:48,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:48,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:48,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:48,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:48,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:48,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:49:48,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:49,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:49,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:49,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:49,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:49:49,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:49,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:49:49,166 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-02-15 10:49:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:49,411 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-02-15 10:49:49,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:49,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:49,413 INFO L225 Difference]: With dead ends: 44 [2019-02-15 10:49:49,413 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 10:49:49,413 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-02-15 10:49:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 10:49:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-02-15 10:49:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:49:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-02-15 10:49:49,425 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-02-15 10:49:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:49,425 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-02-15 10:49:49,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-02-15 10:49:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:49,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:49,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:49,426 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:49,426 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-15 10:49:49,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:49,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:49,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:49,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:49,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:49:49,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:49,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:49,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:49,547 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-15 10:49:49,548 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:49,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:49,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:49,552 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:49,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:49,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:49,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:49,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:49,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:49,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:49,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,575 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 18 treesize of output 24 [2019-02-15 10:49:49,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,579 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 20 treesize of output 34 [2019-02-15 10:49:49,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:49,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:49,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:49,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:49,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:49,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:49,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:49,772 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:49,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:49:49,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:49,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:49,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:49,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:49,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:49,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:49,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:49,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:49,868 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-02-15 10:49:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:50,164 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-02-15 10:49:50,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:50,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:50,165 INFO L225 Difference]: With dead ends: 49 [2019-02-15 10:49:50,165 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 10:49:50,166 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-02-15 10:49:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 10:49:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-02-15 10:49:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 10:49:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-02-15 10:49:50,180 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-02-15 10:49:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:50,181 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-02-15 10:49:50,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-02-15 10:49:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:50,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:50,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:50,182 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-15 10:49:50,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:50,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:50,435 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-02-15 10:49:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:50,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:50,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:50,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:50,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:50,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:50,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:50,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:50,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:50,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:49:50,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:50,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:50,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:50,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,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 18 treesize of output 24 [2019-02-15 10:49:50,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,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 20 treesize of output 34 [2019-02-15 10:49:50,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,488 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 22 treesize of output 45 [2019-02-15 10:49:50,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,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-02-15 10:49:50,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:50,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:50,722 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-02-15 10:49:50,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:49:50,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:51,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:51,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:51,285 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-15 10:49:51,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:51,512 INFO L303 Elim1Store]: Index analysis took 217 ms [2019-02-15 10:49:51,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:49:51,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:51,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:51,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:51,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:51,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:51,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:51,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:51,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:51,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:51,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:51,986 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-02-15 10:49:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:52,496 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-02-15 10:49:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:52,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:52,500 INFO L225 Difference]: With dead ends: 58 [2019-02-15 10:49:52,500 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:49:52,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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-02-15 10:49:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:49:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-02-15 10:49:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 10:49:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-02-15 10:49:52,516 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-02-15 10:49:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:52,516 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-02-15 10:49:52,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-02-15 10:49:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:52,517 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:52,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:52,517 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-02-15 10:49:52,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:52,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:52,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:52,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:52,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:52,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:52,616 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-02-15 10:49:52,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:52,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:52,622 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:52,622 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:52,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:52,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:52,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:52,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:52,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:52,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:52,663 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 18 treesize of output 20 [2019-02-15 10:49:52,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:52,681 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 20 treesize of output 26 [2019-02-15 10:49:52,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:52,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:52,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:49:52,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:52,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:52,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:52,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:52,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:52,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-15 10:49:52,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:52,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:52,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:52,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:52,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:49:52,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:52,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:52,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:49:52,991 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:49:53,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:53,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:53,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:53,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:53,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:53,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:53,161 INFO L303 Elim1Store]: Index analysis took 166 ms [2019-02-15 10:49:53,162 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-02-15 10:49:53,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:53,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:53,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:49:53,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-02-15 10:49:53,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:54,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:54,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:54,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:54,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:54,049 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-02-15 10:49:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:54,354 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-02-15 10:49:54,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:54,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:54,356 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:49:54,356 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 10:49:54,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:49:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 10:49:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-02-15 10:49:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:49:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-02-15 10:49:54,368 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-02-15 10:49:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:54,368 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-02-15 10:49:54,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-02-15 10:49:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:54,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:54,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:54,370 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-02-15 10:49:54,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:54,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:54,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:54,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:54,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:54,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:54,511 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-02-15 10:49:54,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:54,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:54,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:54,516 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:54,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:54,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:54,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:54,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:54,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:54,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:54,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:54,571 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 18 treesize of output 20 [2019-02-15 10:49:54,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 10:49:54,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:54,593 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-15 10:49:54,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:54,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:54,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:54,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:54,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:54,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-02-15 10:49:54,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:54,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:54,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:49:54,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:54,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:54,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-15 10:49:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:54,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:54,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:49:54,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:49:54,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:54,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:49:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:49:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:49:54,703 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-02-15 10:49:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:54,971 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-02-15 10:49:54,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:49:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:49:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:54,972 INFO L225 Difference]: With dead ends: 74 [2019-02-15 10:49:54,972 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 10:49:54,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:49:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 10:49:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-02-15 10:49:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 10:49:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-02-15 10:49:54,990 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-02-15 10:49:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:54,991 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-02-15 10:49:54,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:49:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-02-15 10:49:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:54,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:54,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:54,991 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-02-15 10:49:54,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:54,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:55,293 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-02-15 10:49:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:55,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:55,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:55,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:55,329 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-15 10:49:55,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:55,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:55,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:55,334 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:55,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:55,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:55,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:55,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:55,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:55,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:55,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,365 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 18 treesize of output 24 [2019-02-15 10:49:55,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,369 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 20 treesize of output 34 [2019-02-15 10:49:55,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:55,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:55,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:55,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:55,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:55,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:55,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:55,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,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-02-15 10:49:55,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:55,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:55,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:55,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,677 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:55,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:49:55,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:55,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-02-15 10:49:55,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:55,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:55,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:49:55,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:55,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-02-15 10:49:55,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:55,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:55,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:55,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:49:55,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:55,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:55,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:55,839 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-02-15 10:49:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:56,291 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-02-15 10:49:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:49:56,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:49:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:56,293 INFO L225 Difference]: With dead ends: 105 [2019-02-15 10:49:56,293 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 10:49:56,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:49:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 10:49:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-02-15 10:49:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 10:49:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-02-15 10:49:56,312 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-02-15 10:49:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:56,313 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-02-15 10:49:56,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-02-15 10:49:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:49:56,313 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:56,313 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:49:56,313 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-02-15 10:49:56,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:56,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:56,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:56,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:49:56,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:56,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:56,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:49:56,369 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-02-15 10:49:56,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:56,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:56,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:56,373 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-15 10:49:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:56,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:56,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:56,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:56,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:56,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:56,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:56,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:56,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2019-02-15 10:49:56,407 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 20 treesize of output 22 [2019-02-15 10:49:56,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:56,434 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-15 10:49:56,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:56,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:56,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:56,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:56,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:56,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-15 10:49:56,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:56,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:56,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:49:56,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:56,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:56,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-15 10:49:56,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:56,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:56,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:56,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:56,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-15 10:49:56,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:56,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:56,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-02-15 10:49:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:56,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:56,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:56,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:49:56,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:56,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:49:56,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:49:56,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:49:56,936 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-02-15 10:49:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:57,089 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-02-15 10:49:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:57,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-15 10:49:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:57,091 INFO L225 Difference]: With dead ends: 85 [2019-02-15 10:49:57,091 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 10:49:57,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 10:49:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-02-15 10:49:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 10:49:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-15 10:49:57,111 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-15 10:49:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:57,112 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-15 10:49:57,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:49:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-15 10:49:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:49:57,112 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:57,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:49:57,113 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:57,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:57,113 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-15 10:49:57,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:57,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:57,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:57,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:57,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:57,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:49:57,222 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-15 10:49:57,223 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:57,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:57,226 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:57,226 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:49:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:57,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:57,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:57,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:57,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:57,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:57,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:57,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,265 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 18 treesize of output 24 [2019-02-15 10:49:57,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,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 20 treesize of output 34 [2019-02-15 10:49:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,285 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 22 treesize of output 45 [2019-02-15 10:49:57,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:57,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:57,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:57,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:57,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:57,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:57,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:57,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:57,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:57,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:57,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:57,545 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-02-15 10:49:57,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:57,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:57,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:57,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:57,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:57,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:57,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:57,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:57,636 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-02-15 10:49:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:57,867 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-02-15 10:49:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:57,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:49:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:57,869 INFO L225 Difference]: With dead ends: 83 [2019-02-15 10:49:57,869 INFO L226 Difference]: Without dead ends: 82 [2019-02-15 10:49:57,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-15 10:49:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-02-15 10:49:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 10:49:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-15 10:49:57,887 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-15 10:49:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:57,888 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-15 10:49:57,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-15 10:49:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:49:57,888 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:57,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:49:57,888 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-15 10:49:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:57,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:57,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:58,113 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-15 10:49:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:49:58,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:58,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:58,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:49:58,162 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-15 10:49:58,164 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:58,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:58,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:58,167 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:49:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:58,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:58,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:58,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:58,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:58,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:58,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:58,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 15 treesize of output 18 [2019-02-15 10:49:58,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,193 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 18 treesize of output 24 [2019-02-15 10:49:58,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,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 20 treesize of output 34 [2019-02-15 10:49:58,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,206 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 22 treesize of output 45 [2019-02-15 10:49:58,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:58,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:58,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:58,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:58,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:58,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:58,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:58,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:58,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:58,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:58,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,361 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-02-15 10:49:58,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:58,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-02-15 10:49:58,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,427 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:58,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:58,430 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-02-15 10:49:58,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:58,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:58,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:49:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:58,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:58,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:58,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:49:58,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:58,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:58,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:58,636 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-02-15 10:49:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:59,044 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-02-15 10:49:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:49:59,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:49:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:59,046 INFO L225 Difference]: With dead ends: 97 [2019-02-15 10:49:59,046 INFO L226 Difference]: Without dead ends: 96 [2019-02-15 10:49:59,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:49:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-15 10:49:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-02-15 10:49:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 10:49:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-15 10:49:59,065 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-15 10:49:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:59,065 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-15 10:49:59,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-15 10:49:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:49:59,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:59,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:49:59,066 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-15 10:49:59,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:59,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:59,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:59,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:59,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:59,610 WARN L181 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:49:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:49:59,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:59,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:59,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:49:59,692 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-15 10:49:59,693 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:59,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:59,696 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:59,696 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:49:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:59,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:59,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:59,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:59,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:59,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:59,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:59,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:49:59,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,721 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 18 treesize of output 24 [2019-02-15 10:49:59,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,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 20 treesize of output 34 [2019-02-15 10:49:59,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:49:59,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:49:59,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:49:59,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:59,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:49:59,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:49:59,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:59,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:49:59,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:59,945 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:59,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:49:59,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:59,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:00,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:00,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:00,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:50:00,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:50:00,064 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-02-15 10:50:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:00,443 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-02-15 10:50:00,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:50:00,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:50:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:00,445 INFO L225 Difference]: With dead ends: 102 [2019-02-15 10:50:00,445 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 10:50:00,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:50:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 10:50:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-02-15 10:50:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-15 10:50:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-02-15 10:50:00,473 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-02-15 10:50:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:00,473 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-02-15 10:50:00,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-02-15 10:50:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:00,474 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:00,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:00,474 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-02-15 10:50:00,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:00,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:00,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:00,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:00,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:00,690 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-15 10:50:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:00,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:00,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:00,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:50:00,735 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-02-15 10:50:00,736 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:00,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:00,739 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:00,740 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:00,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:00,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:00,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:00,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:00,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:00,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:00,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:00,764 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 18 treesize of output 20 [2019-02-15 10:50:00,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-02-15 10:50:00,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:50:00,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:00,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:00,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:00,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:00,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:00,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-15 10:50:00,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,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, 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-02-15 10:50:00,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:00,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:00,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:50:00,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,893 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:00,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-15 10:50:00,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:00,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:00,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-02-15 10:50:00,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:00,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2019-02-15 10:50:00,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:00,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-02-15 10:50:00,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-02-15 10:50:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:00,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:01,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:01,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:50:01,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:01,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:50:01,027 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-02-15 10:50:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:01,695 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-02-15 10:50:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:50:01,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:50:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:01,696 INFO L225 Difference]: With dead ends: 108 [2019-02-15 10:50:01,696 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 10:50:01,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 10:50:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-02-15 10:50:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:50:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-02-15 10:50:01,718 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-02-15 10:50:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:01,718 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-02-15 10:50:01,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-02-15 10:50:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:01,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:01,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:01,719 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-02-15 10:50:01,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:01,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:01,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:01,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:01,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:01,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:01,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:01,889 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:50:01,889 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-15 10:50:01,890 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:01,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:01,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:01,893 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:01,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:01,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:01,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:01,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:01,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:01,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:01,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 15 treesize of output 18 [2019-02-15 10:50:01,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:01,917 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 18 treesize of output 24 [2019-02-15 10:50:01,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:01,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:01,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:50:01,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:01,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:01,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:01,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:50:01,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:01,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:01,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:01,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:01,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:01,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:02,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:02,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:02,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:02,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:02,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,072 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:02,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:50:02,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:02,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:02,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:50:02,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,138 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-02-15 10:50:02,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:02,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:02,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:02,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:02,203 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:02,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:50:02,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:02,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:02,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:02,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:02,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:02,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:50:02,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:02,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:50:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:50:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:02,447 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-02-15 10:50:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:03,889 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-02-15 10:50:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:03,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:50:03,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:03,891 INFO L225 Difference]: With dead ends: 120 [2019-02-15 10:50:03,891 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 10:50:03,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:50:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 10:50:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-02-15 10:50:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-15 10:50:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-02-15 10:50:03,914 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-02-15 10:50:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:03,914 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-02-15 10:50:03,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:50:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-02-15 10:50:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:03,915 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:03,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:03,915 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-02-15 10:50:03,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:03,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:03,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:03,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:04,130 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-02-15 10:50:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:04,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:04,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:04,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:04,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:04,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:04,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:04,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:04,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:04,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:50:04,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:04,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:04,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 15 treesize of output 18 [2019-02-15 10:50:04,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:50:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,242 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 20 treesize of output 34 [2019-02-15 10:50:04,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,249 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 22 treesize of output 45 [2019-02-15 10:50:04,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:04,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:04,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:04,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:04,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:50:04,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:04,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:04,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,484 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:04,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 10:50:04,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:04,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:04,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,559 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:04,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:04,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:50:04,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:04,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-02-15 10:50:04,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:50:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:04,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:04,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:04,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:50:04,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:04,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:50:04,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:50:04,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:50:04,717 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-02-15 10:50:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:05,309 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-02-15 10:50:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:05,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:50:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:05,312 INFO L225 Difference]: With dead ends: 146 [2019-02-15 10:50:05,312 INFO L226 Difference]: Without dead ends: 145 [2019-02-15 10:50:05,313 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-02-15 10:50:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-15 10:50:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-02-15 10:50:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 10:50:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-02-15 10:50:05,339 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-02-15 10:50:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:05,339 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-02-15 10:50:05,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:50:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-02-15 10:50:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:05,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:05,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:05,341 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:05,341 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-15 10:50:05,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:05,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:05,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:05,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:05,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:05,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:05,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:05,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:50:05,437 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-15 10:50:05,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:05,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:05,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:05,440 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:05,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:05,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:05,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:05,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:05,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:05,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:05,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:05,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,466 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 18 treesize of output 24 [2019-02-15 10:50:05,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,471 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 20 treesize of output 34 [2019-02-15 10:50:05,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:50:05,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:05,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:05,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:05,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:05,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:05,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:05,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:05,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:05,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:05,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:05,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:05,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:50:05,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:05,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:05,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:05,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:05,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:05,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:50:05,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:05,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:50:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:50:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:50:05,707 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-02-15 10:50:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:05,959 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-02-15 10:50:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:50:05,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-15 10:50:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:05,961 INFO L225 Difference]: With dead ends: 111 [2019-02-15 10:50:05,961 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 10:50:05,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 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-02-15 10:50:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 10:50:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-02-15 10:50:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 10:50:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-02-15 10:50:05,985 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-02-15 10:50:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:05,986 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-02-15 10:50:05,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:50:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-02-15 10:50:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:05,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:05,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:05,987 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:05,987 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-15 10:50:05,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:05,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:05,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:06,195 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-15 10:50:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:06,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:06,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:06,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:50:06,237 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-15 10:50:06,238 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:06,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:06,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:06,241 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:06,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:06,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:06,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:06,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:06,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:06,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:06,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:06,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,306 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 18 treesize of output 24 [2019-02-15 10:50:06,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,312 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 20 treesize of output 34 [2019-02-15 10:50:06,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,318 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 22 treesize of output 45 [2019-02-15 10:50:06,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:06,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:06,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:06,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:06,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:06,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:06,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:06,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:06,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:06,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:06,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,487 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:06,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:50:06,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:06,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:06,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:06,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:06,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:50:06,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:06,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:06,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:06,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:06,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:06,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:50:06,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:06,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:50:06,695 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-02-15 10:50:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:07,107 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-02-15 10:50:07,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:07,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:50:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:07,110 INFO L225 Difference]: With dead ends: 153 [2019-02-15 10:50:07,110 INFO L226 Difference]: Without dead ends: 152 [2019-02-15 10:50:07,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-15 10:50:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-02-15 10:50:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-15 10:50:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-02-15 10:50:07,140 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-02-15 10:50:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:07,140 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-02-15 10:50:07,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-02-15 10:50:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:07,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:07,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:07,141 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-15 10:50:07,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:07,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:07,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:07,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:07,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:50:07,228 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-15 10:50:07,229 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:07,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:07,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:07,232 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:07,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:07,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:07,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:07,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:07,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:07,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:07,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:07,289 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 18 treesize of output 20 [2019-02-15 10:50:07,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,333 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 20 treesize of output 26 [2019-02-15 10:50:07,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:50:07,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:07,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-15 10:50:07,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,417 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-02-15 10:50:07,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:07,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:50:07,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,471 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:07,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-15 10:50:07,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:07,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:50:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:07,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:07,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:07,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:50:07,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:07,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:50:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:50:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:50:07,550 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-02-15 10:50:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:07,787 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-02-15 10:50:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:50:07,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:50:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:07,790 INFO L225 Difference]: With dead ends: 143 [2019-02-15 10:50:07,790 INFO L226 Difference]: Without dead ends: 138 [2019-02-15 10:50:07,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:50:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-15 10:50:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-02-15 10:50:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-15 10:50:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-02-15 10:50:07,820 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-02-15 10:50:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:07,820 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-02-15 10:50:07,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:50:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-02-15 10:50:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:07,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:07,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:07,821 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:07,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-15 10:50:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:07,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:07,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:07,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:07,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:07,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:07,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:07,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:07,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:07,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:07,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:07,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:50:07,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:07,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:07,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:07,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,970 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 18 treesize of output 24 [2019-02-15 10:50:07,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:50:07,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:07,990 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 22 treesize of output 45 [2019-02-15 10:50:07,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:08,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:08,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:08,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:08,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:08,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:50:08,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:08,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:08,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:08,201 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:08,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:50:08,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:08,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:08,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:08,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:50:08,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:08,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:50:08,341 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-02-15 10:50:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:08,794 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-02-15 10:50:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:50:08,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:50:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:08,797 INFO L225 Difference]: With dead ends: 196 [2019-02-15 10:50:08,797 INFO L226 Difference]: Without dead ends: 195 [2019-02-15 10:50:08,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:50:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-15 10:50:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-02-15 10:50:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-15 10:50:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-02-15 10:50:08,828 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-02-15 10:50:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:08,828 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-02-15 10:50:08,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-02-15 10:50:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:08,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:08,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:08,829 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-02-15 10:50:08,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:08,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:08,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:08,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:08,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:09,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:09,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:09,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:09,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:09,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:09,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:09,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:09,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:09,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:09,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:09,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:09,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,087 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 18 treesize of output 24 [2019-02-15 10:50:09,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:50:09,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:50:09,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:09,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:09,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:09,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:50:09,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:09,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:09,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,304 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:09,305 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-02-15 10:50:09,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50: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-02-15 10:50:09,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:09,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:09,376 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:09,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:50:09,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:09,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:09,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:09,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:09,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:50:09,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:09,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:50:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:50:09,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:09,515 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-02-15 10:50:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:10,025 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-02-15 10:50:10,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:50:10,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:50:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:10,028 INFO L225 Difference]: With dead ends: 205 [2019-02-15 10:50:10,028 INFO L226 Difference]: Without dead ends: 197 [2019-02-15 10:50:10,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:50:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-15 10:50:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-02-15 10:50:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-15 10:50:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-02-15 10:50:10,071 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-02-15 10:50:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:10,071 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-02-15 10:50:10,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:50:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-02-15 10:50:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:10,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:10,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:10,072 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-15 10:50:10,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:10,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:10,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:10,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:10,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:10,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:10,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:10,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:50:10,150 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-15 10:50:10,150 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:10,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:10,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:10,153 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:10,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:10,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:10,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:10,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:10,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:10,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:10,177 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 18 treesize of output 20 [2019-02-15 10:50:10,187 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 20 treesize of output 22 [2019-02-15 10:50:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,205 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-15 10:50:10,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:10,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-15 10:50:10,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,262 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-02-15 10:50:10,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-15 10:50:10,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,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, 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-02-15 10:50:10,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:10,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-15 10:50:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:10,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:10,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:10,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:50:10,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:10,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:50:10,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:50:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:50:10,350 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-02-15 10:50:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:10,526 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-02-15 10:50:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:50:10,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:50:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:10,528 INFO L225 Difference]: With dead ends: 165 [2019-02-15 10:50:10,528 INFO L226 Difference]: Without dead ends: 164 [2019-02-15 10:50:10,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:50:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-15 10:50:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-02-15 10:50:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-15 10:50:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-02-15 10:50:10,575 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-02-15 10:50:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:10,575 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-02-15 10:50:10,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:50:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-02-15 10:50:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:50:10,576 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:10,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:50:10,576 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:10,576 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-02-15 10:50:10,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:10,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:10,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:10,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:10,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:10,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:10,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:10,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:50:10,659 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-02-15 10:50:10,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:10,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:10,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:10,664 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:10,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:10,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:10,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:10,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:10,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:10,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:10,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:10,686 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 18 treesize of output 20 [2019-02-15 10:50:10,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,702 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 20 treesize of output 26 [2019-02-15 10:50:10,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:50:10,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,740 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:10,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-15 10:50:10,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:50:10,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:10,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:50:10,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:10,833 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 48 [2019-02-15 10:50:10,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:10,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:10,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:50:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:10,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:10,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:10,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:50:10,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:10,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:50:10,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:50:10,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:50:10,913 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-02-15 10:50:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:11,165 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-02-15 10:50:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:50:11,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:50:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:11,169 INFO L225 Difference]: With dead ends: 174 [2019-02-15 10:50:11,169 INFO L226 Difference]: Without dead ends: 173 [2019-02-15 10:50:11,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:50:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-15 10:50:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-02-15 10:50:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-15 10:50:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-02-15 10:50:11,218 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-02-15 10:50:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:11,218 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-02-15 10:50:11,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:50:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-02-15 10:50:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:11,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:11,219 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 10:50:11,220 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-02-15 10:50:11,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:11,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:11,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:11,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:11,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:11,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:11,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:11,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:11,284 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-02-15 10:50:11,284 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:11,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:11,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:11,289 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-15 10:50:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:11,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:11,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:11,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:11,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:11,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:11,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:11,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:11,310 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 18 treesize of output 20 [2019-02-15 10:50:11,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 10:50:11,339 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-15 10:50:11,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:11,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-02-15 10:50:11,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:11,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 10:50:11,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 10:50:11,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:11,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-15 10:50:11,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:11,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-15 10:50:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:11,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:11,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:50:11,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-02-15 10:50:11,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:50:11,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 10:50:11,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 10:50:11,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:50:11,486 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-02-15 10:50:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:11,627 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-02-15 10:50:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:50:11,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-15 10:50:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:11,631 INFO L225 Difference]: With dead ends: 357 [2019-02-15 10:50:11,631 INFO L226 Difference]: Without dead ends: 353 [2019-02-15 10:50:11,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:50:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-02-15 10:50:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-02-15 10:50:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-15 10:50:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-02-15 10:50:11,761 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-02-15 10:50:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:11,761 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-02-15 10:50:11,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 10:50:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-02-15 10:50:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:11,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:11,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:11,763 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-02-15 10:50:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:11,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:11,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:12,019 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-15 10:50:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:12,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:12,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:12,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:12,107 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-15 10:50:12,108 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:12,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:12,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:12,111 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-15 10:50:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:12,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:12,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:12,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:12,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:12,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:12,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:12,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 15 treesize of output 18 [2019-02-15 10:50:12,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,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 18 treesize of output 24 [2019-02-15 10:50:12,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:50:12,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,253 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 22 treesize of output 45 [2019-02-15 10:50:12,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:12,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:12,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:12,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:12,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-02-15 10:50:12,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:12,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:12,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:12,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-02-15 10:50:12,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:12,440 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-02-15 10:50:12,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:12,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:12,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:12,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:12,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:50:12,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:12,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:50:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:50:12,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:50:12,646 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-02-15 10:50:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:12,931 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-02-15 10:50:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:50:12,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:50:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:12,936 INFO L225 Difference]: With dead ends: 348 [2019-02-15 10:50:12,936 INFO L226 Difference]: Without dead ends: 338 [2019-02-15 10:50:12,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-02-15 10:50:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-15 10:50:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-02-15 10:50:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-15 10:50:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-02-15 10:50:13,035 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-02-15 10:50:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:13,035 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-02-15 10:50:13,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:50:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-02-15 10:50:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:13,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:13,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:13,037 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:13,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-15 10:50:13,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:13,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:13,616 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-15 10:50:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:13,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:13,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:13,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:13,696 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-15 10:50:13,697 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:13,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:13,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:13,700 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-15 10:50:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:13,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:13,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:13,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:13,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:13,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:13,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:13,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:13,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:50:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:50:13,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:50:13,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:13,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:13,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:13,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:13,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:13,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:13,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:13,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:13,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:13,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:13,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:13,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:50:13,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:14,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:14,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:14,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,074 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:14,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,076 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-02-15 10:50:14,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:14,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:14,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:50:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:14,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:14,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:14,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:50:14,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:14,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:50:14,236 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-02-15 10:50:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:14,657 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-02-15 10:50:14,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:50:14,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:50:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:14,660 INFO L225 Difference]: With dead ends: 348 [2019-02-15 10:50:14,660 INFO L226 Difference]: Without dead ends: 343 [2019-02-15 10:50:14,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:50:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-02-15 10:50:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-02-15 10:50:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-02-15 10:50:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-02-15 10:50:14,747 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-02-15 10:50:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:14,748 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-02-15 10:50:14,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-02-15 10:50:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:14,749 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:14,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:14,750 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-15 10:50:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:14,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:14,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:14,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:14,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:14,965 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-15 10:50:14,966 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:14,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:14,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:14,969 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-15 10:50:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:14,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:14,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:14,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:14,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:14,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:14,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:14,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:14,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,991 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 18 treesize of output 24 [2019-02-15 10:50:14,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:14,997 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 20 treesize of output 34 [2019-02-15 10:50:15,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,008 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 22 treesize of output 45 [2019-02-15 10:50:15,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:15,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:15,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:15,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:15,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:50:15,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:15,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:15,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,239 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:15,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:50:15,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:15,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:15,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,306 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:15,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:15,308 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-02-15 10:50:15,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:15,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:15,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:50:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:15,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:50:15,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:15,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:50:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:50:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:15,430 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-02-15 10:50:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:16,074 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-02-15 10:50:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:50:16,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:50:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:16,078 INFO L225 Difference]: With dead ends: 457 [2019-02-15 10:50:16,078 INFO L226 Difference]: Without dead ends: 456 [2019-02-15 10:50:16,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:50:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-02-15 10:50:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-02-15 10:50:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-15 10:50:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-02-15 10:50:16,193 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-02-15 10:50:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:16,193 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-02-15 10:50:16,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:50:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-02-15 10:50:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:16,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:16,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:16,195 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-15 10:50:16,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:16,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:16,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:16,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:16,432 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2019-02-15 10:50:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:16,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:16,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:16,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:16,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:16,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:16,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:16,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:16,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:16,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:50:16,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:16,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:16,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:50:16,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,539 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 20 treesize of output 34 [2019-02-15 10:50:16,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,545 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 22 treesize of output 45 [2019-02-15 10:50:16,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:16,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:16,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:16,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:16,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,684 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:16,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:50:16,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,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-02-15 10:50:16,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-02-15 10:50:16,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 10:50:16,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:16,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:16,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:16,816 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:16,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:50:16,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:16,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:16,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:16,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:16,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:16,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:50:16,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:16,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:50:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:50:16,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:16,944 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-02-15 10:50:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:17,477 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-02-15 10:50:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:17,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:50:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:17,481 INFO L225 Difference]: With dead ends: 346 [2019-02-15 10:50:17,482 INFO L226 Difference]: Without dead ends: 345 [2019-02-15 10:50:17,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:50:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-02-15 10:50:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-02-15 10:50:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-15 10:50:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-02-15 10:50:17,553 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-02-15 10:50:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:17,553 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-02-15 10:50:17,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:50:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-02-15 10:50:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:17,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:17,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:17,554 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:17,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-02-15 10:50:17,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:17,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:17,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:17,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:17,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:17,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-02-15 10:50:17,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:17,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:17,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:17,702 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-15 10:50:17,703 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:17,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:17,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:17,706 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-15 10:50:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:17,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:17,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:17,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:17,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:17,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:17,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:17,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:17,731 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 18 treesize of output 20 [2019-02-15 10:50:17,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-02-15 10:50:17,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:50:17,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:17,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:17,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:17,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:17,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:17,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-15 10:50:17,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,818 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-02-15 10:50:17,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:17,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:17,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:50:17,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,854 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:17,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-15 10:50:17,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:17,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:17,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-02-15 10:50:17,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:17,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2019-02-15 10:50:17,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:17,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:17,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-02-15 10:50:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:17,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:17,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:17,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:50:17,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:17,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:50:17,980 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-02-15 10:50:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:18,350 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-02-15 10:50:18,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:18,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:50:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:18,352 INFO L225 Difference]: With dead ends: 280 [2019-02-15 10:50:18,352 INFO L226 Difference]: Without dead ends: 277 [2019-02-15 10:50:18,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 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-02-15 10:50:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-02-15 10:50:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-02-15 10:50:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-02-15 10:50:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-02-15 10:50:18,445 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-02-15 10:50:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:18,445 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-02-15 10:50:18,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-02-15 10:50:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:18,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:18,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:18,446 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-02-15 10:50:18,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:18,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:18,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:18,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:18,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:18,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:18,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:18,564 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:18,564 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-02-15 10:50:18,565 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:18,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:18,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:18,567 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-15 10:50:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:18,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:18,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:18,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:18,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:18,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:18,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:18,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 15 treesize of output 18 [2019-02-15 10:50:18,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2019-02-15 10:50:18,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 10:50:18,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:18,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-15 10:50:18,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:18,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:18,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:18,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:18,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:18,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-15 10:50:18,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:18,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:18,678 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-02-15 10:50:18,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:18,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:18,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-15 10:50:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:18,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:18,706 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-02-15 10:50:18,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:18,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:18,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-15 10:50:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:18,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:18,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:18,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 10:50:18,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:18,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:50:18,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:50:18,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:50:18,766 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-02-15 10:50:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:19,107 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-02-15 10:50:19,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:50:19,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 10:50:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:19,112 INFO L225 Difference]: With dead ends: 390 [2019-02-15 10:50:19,112 INFO L226 Difference]: Without dead ends: 377 [2019-02-15 10:50:19,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-02-15 10:50:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-02-15 10:50:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-02-15 10:50:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-15 10:50:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-02-15 10:50:19,237 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-02-15 10:50:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:19,237 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-02-15 10:50:19,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:50:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-02-15 10:50:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:19,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:19,238 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 10:50:19,239 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:19,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:19,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-02-15 10:50:19,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:19,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:19,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:19,401 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-02-15 10:50:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:19,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:19,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:19,493 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:19,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:19,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:19,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:19,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:19,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:19,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:19,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:19,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,515 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 18 treesize of output 24 [2019-02-15 10:50:19,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:50:19,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:50:19,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:19,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:19,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:19,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:50:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:19,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:19,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,738 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:19,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 10:50:19,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:19,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:19,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:50:19,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:19,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:50:19,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:19,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 10:50:19,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:19,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:19,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:20,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:20,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 10:50:20,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:20,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:50:20,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:50:20,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:50:20,036 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-02-15 10:50:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:20,640 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-02-15 10:50:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:50:20,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 10:50:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:20,644 INFO L225 Difference]: With dead ends: 375 [2019-02-15 10:50:20,644 INFO L226 Difference]: Without dead ends: 374 [2019-02-15 10:50:20,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:50:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-15 10:50:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-02-15 10:50:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-15 10:50:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-02-15 10:50:20,841 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-02-15 10:50:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:20,842 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-02-15 10:50:20,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:50:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-02-15 10:50:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:20,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:20,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:20,844 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-02-15 10:50:20,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:20,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:20,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:21,028 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-15 10:50:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:21,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:21,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:21,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:21,078 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-15 10:50:21,079 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:21,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:21,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:21,081 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-15 10:50:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:21,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:21,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:21,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:21,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:21,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:21,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:21,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:21,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,140 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 18 treesize of output 24 [2019-02-15 10:50:21,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,184 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 20 treesize of output 34 [2019-02-15 10:50:21,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,197 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 22 treesize of output 45 [2019-02-15 10:50:21,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:21,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:21,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:21,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:21,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-02-15 10:50:21,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:21,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:21,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:21,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-02-15 10:50:21,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:21,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:21,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:50:21,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:21,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-02-15 10:50:21,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:21,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:21,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:21,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:50:21,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:21,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:50:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:50:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:50:21,423 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-02-15 10:50:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:21,708 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-02-15 10:50:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:50:21,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 10:50:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:21,710 INFO L225 Difference]: With dead ends: 157 [2019-02-15 10:50:21,710 INFO L226 Difference]: Without dead ends: 150 [2019-02-15 10:50:21,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:50:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-15 10:50:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-15 10:50:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-15 10:50:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-02-15 10:50:21,839 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-02-15 10:50:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:21,839 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-02-15 10:50:21,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:50:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-02-15 10:50:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:21,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:21,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:21,841 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:21,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-15 10:50:21,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:21,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:22,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:22,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:22,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:50:22,002 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-15 10:50:22,003 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:22,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:22,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:22,007 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-15 10:50:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:22,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:22,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:22,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:22,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:22,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:22,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:22,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:22,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,040 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 18 treesize of output 24 [2019-02-15 10:50:22,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,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 20 treesize of output 34 [2019-02-15 10:50:22,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:50:22,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:22,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:22,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:22,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:22,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:22,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:22,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:22,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:22,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:22,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:22,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,195 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:22,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:50:22,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:22,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:22,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:22,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:22,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:50:22,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:22,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-02-15 10:50:22,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:22,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:22,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:22,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:50:22,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:22,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:50:22,409 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-02-15 10:50:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:22,923 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-02-15 10:50:22,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:50:22,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:50:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:22,926 INFO L225 Difference]: With dead ends: 206 [2019-02-15 10:50:22,926 INFO L226 Difference]: Without dead ends: 199 [2019-02-15 10:50:22,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:50:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-15 10:50:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-02-15 10:50:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-15 10:50:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-02-15 10:50:23,100 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-02-15 10:50:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:23,100 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-02-15 10:50:23,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-02-15 10:50:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:50:23,101 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:23,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:23,101 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-15 10:50:23,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:23,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:23,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:23,406 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-02-15 10:50:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:23,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:23,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:23,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:23,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:23,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:23,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:23,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:23,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:23,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:50:23,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:23,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:23,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:23,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2019-02-15 10:50:23,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-02-15 10:50:23,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:50:23,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:23,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-15 10:50:23,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:50:23,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:23,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:50:23,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:50:23,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:23,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-02-15 10:50:23,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:23,701 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:23,701 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 55 [2019-02-15 10:50:23,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,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-02-15 10:50:23,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:50:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:23,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:23,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:23,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:50:23,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:23,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:23,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:23,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:50:23,794 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-02-15 10:50:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:24,232 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-02-15 10:50:24,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:50:24,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:50:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:24,233 INFO L225 Difference]: With dead ends: 161 [2019-02-15 10:50:24,233 INFO L226 Difference]: Without dead ends: 156 [2019-02-15 10:50:24,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-15 10:50:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-02-15 10:50:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 10:50:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-02-15 10:50:24,298 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-02-15 10:50:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:24,298 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-02-15 10:50:24,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-02-15 10:50:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:50:24,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:24,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:24,299 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:24,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-02-15 10:50:24,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:24,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:24,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:24,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:24,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:24,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:50:24,455 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-15 10:50:24,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:24,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:24,459 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:24,459 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 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-02-15 10:50:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:24,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:24,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:24,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:24,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:24,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:24,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:24,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:24,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,482 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 18 treesize of output 24 [2019-02-15 10:50:24,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,496 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 20 treesize of output 34 [2019-02-15 10:50:24,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,505 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 22 treesize of output 45 [2019-02-15 10:50:24,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:24,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:24,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:24,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:24,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:24,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:24,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:24,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:24,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:24,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:50:24,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:24,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:24,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:24,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:24,709 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:24,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 33 treesize of output 77 [2019-02-15 10:50:24,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:24,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:24,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:24,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:24,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:24,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:50:24,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:24,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:50:24,814 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-02-15 10:50:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:25,187 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-02-15 10:50:25,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:50:25,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 10:50:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:25,188 INFO L225 Difference]: With dead ends: 62 [2019-02-15 10:50:25,189 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 10:50:25,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 10:50:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-02-15 10:50:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 10:50:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-02-15 10:50:25,288 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-02-15 10:50:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:25,288 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-02-15 10:50:25,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-02-15 10:50:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:50:25,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:25,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:25,289 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-02-15 10:50:25,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:25,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:25,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:25,848 WARN L181 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-15 10:50:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:50:25,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:25,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:25,877 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:50:25,878 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-02-15 10:50:25,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:25,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:25,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:25,881 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 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-02-15 10:50:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:25,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:25,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:25,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:25,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:25,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:25,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:25,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:25,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,913 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 18 treesize of output 24 [2019-02-15 10:50:25,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,916 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 20 treesize of output 34 [2019-02-15 10:50:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,922 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 22 treesize of output 45 [2019-02-15 10:50:25,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:25,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:25,949 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:25,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:25,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:25,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:25,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:25,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:26,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:26,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:26,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:26,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:50:26,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:26,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:26,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,122 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:26,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:50:26,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:26,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:26,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:26,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:26,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:26,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-15 10:50:26,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:26,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:50:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:50:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:50:26,228 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-02-15 10:50:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:26,619 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-02-15 10:50:26,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:50:26,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-15 10:50:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:26,620 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:50:26,620 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 10:50:26,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:50:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 10:50:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-02-15 10:50:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 10:50:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-02-15 10:50:26,751 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-02-15 10:50:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:26,751 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-02-15 10:50:26,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:50:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-02-15 10:50:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:50:26,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:26,752 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:26,752 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-02-15 10:50:26,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:26,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:26,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:26,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:26,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:50:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:26,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:26,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:26,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:26,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:26,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:26,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:26,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:50:26,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:26,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:26,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 15 treesize of output 18 [2019-02-15 10:50:26,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,924 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 18 treesize of output 24 [2019-02-15 10:50:26,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,933 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 20 treesize of output 34 [2019-02-15 10:50:26,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:26,938 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 22 treesize of output 45 [2019-02-15 10:50:26,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:26,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:26,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:26,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:27,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:27,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:27,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:50:27,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:27,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:27,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:27,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,098 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-02-15 10:50:27,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:27,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:27,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:27,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 10:50:27,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:27,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:27,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:27,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:27,236 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 89 [2019-02-15 10:50:27,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:27,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:27,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:27,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:27,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:27,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-15 10:50:27,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:27,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:27,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:50:27,383 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-02-15 10:50:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:27,877 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-02-15 10:50:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:27,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 10:50:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:27,878 INFO L225 Difference]: With dead ends: 67 [2019-02-15 10:50:27,878 INFO L226 Difference]: Without dead ends: 32 [2019-02-15 10:50:27,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:50:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-15 10:50:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-02-15 10:50:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:50:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-02-15 10:50:27,969 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-02-15 10:50:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:27,970 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-02-15 10:50:27,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-02-15 10:50:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:50:27,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:27,970 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:27,970 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-02-15 10:50:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:27,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:27,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:27,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:50:28,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:28,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:28,079 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:50:28,079 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-02-15 10:50:28,080 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:28,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:28,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:28,082 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 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-02-15 10:50:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:28,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:28,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:28,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:28,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:28,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:28,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:28,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:28,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,104 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 18 treesize of output 24 [2019-02-15 10:50:28,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,108 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 20 treesize of output 34 [2019-02-15 10:50:28,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,114 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 22 treesize of output 45 [2019-02-15 10:50:28,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:28,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:28,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:28,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:28,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:28,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:50:28,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:28,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:28,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,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-02-15 10:50:28,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:28,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:28,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:28,380 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:28,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:50:28,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:28,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:28,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:28,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-15 10:50:28,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:28,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:50:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:50:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:50:28,499 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-02-15 10:50:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:28,881 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-02-15 10:50:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:28,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 10:50:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:28,882 INFO L225 Difference]: With dead ends: 47 [2019-02-15 10:50:28,882 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 10:50:28,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:50:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 10:50:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-02-15 10:50:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 10:50:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-02-15 10:50:29,003 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-02-15 10:50:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:29,003 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-02-15 10:50:29,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:50:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-02-15 10:50:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:50:29,003 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:29,004 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:29,004 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:29,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-02-15 10:50:29,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:29,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:29,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:29,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:29,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 10:50:29,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:29,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:29,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:29,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:29,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:29,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:29,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:29,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:50:29,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:29,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:29,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:29,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,162 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 18 treesize of output 24 [2019-02-15 10:50:29,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,172 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 20 treesize of output 34 [2019-02-15 10:50:29,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,184 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 22 treesize of output 45 [2019-02-15 10:50:29,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:29,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:29,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:29,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:29,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:29,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:50:29,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:29,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:29,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,514 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:29,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:50:29,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:29,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:29,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:29,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-15 10:50:29,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,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-02-15 10:50:29,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:29,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:29,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:29,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:50:29,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:29,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:50:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:50:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:29,704 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-02-15 10:50:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:30,141 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-02-15 10:50:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:50:30,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 10:50:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:30,143 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:50:30,143 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 10:50:30,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:50:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 10:50:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-02-15 10:50:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:50:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-02-15 10:50:30,273 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-02-15 10:50:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:30,274 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-02-15 10:50:30,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:50:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-02-15 10:50:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:50:30,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:30,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:30,274 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:30,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-02-15 10:50:30,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:30,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:30,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:50:30,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:30,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:30,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:50:30,543 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-02-15 10:50:30,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:50:30,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:50:30,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:50:30,547 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:50:30,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:30,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:50:30,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:30,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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:30,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:30,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:30,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:30,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:30,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,574 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 18 treesize of output 24 [2019-02-15 10:50:30,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,580 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 20 treesize of output 34 [2019-02-15 10:50:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:50:30,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:30,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:30,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:30,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:30,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:30,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:30,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:30,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:30,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:30,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:30,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,940 INFO L303 Elim1Store]: Index analysis took 210 ms [2019-02-15 10:50:30,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 31 treesize of output 65 [2019-02-15 10:50:30,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:30,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-02-15 10:50:30,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:30,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:30,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,009 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:31,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:50:31,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:31,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:31,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:31,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:31,078 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:31,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:50:31,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:31,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-02-15 10:50:31,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:31,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:31,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:31,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:50:31,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:31,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:50:31,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:50:31,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:50:31,323 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-02-15 10:50:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:31,885 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-02-15 10:50:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:50:31,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 10:50:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:31,886 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:50:31,886 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 10:50:31,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:50:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 10:50:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-02-15 10:50:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:50:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-02-15 10:50:32,036 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-02-15 10:50:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:32,036 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-02-15 10:50:32,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:50:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-02-15 10:50:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:50:32,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:32,036 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:50:32,036 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:32,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-02-15 10:50:32,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:32,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:32,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:32,180 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 19 [2019-02-15 10:50:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:50:32,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:32,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:32,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:32,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:32,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:32,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:32,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:32,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:32,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:50:32,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:32,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:32,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:50:32,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,373 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 18 treesize of output 24 [2019-02-15 10:50:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,379 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 20 treesize of output 34 [2019-02-15 10:50:32,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,384 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 22 treesize of output 45 [2019-02-15 10:50:32,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-15 10:50:32,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:50:32,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,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-02-15 10:50:32,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:50:32,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,567 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:50:32,568 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-02-15 10:50:32,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:32,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-15 10:50:32,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 10:50:32,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:32,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:32,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-15 10:50:32,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:32,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:32,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:50:32,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-15 10:50:32,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:32,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:50:32,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:50:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:32,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:32,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:32,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-02-15 10:50:32,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:32,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:50:32,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:50:32,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:50:32,920 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-02-15 10:50:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:33,543 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-02-15 10:50:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:50:33,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-15 10:50:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:33,543 INFO L225 Difference]: With dead ends: 48 [2019-02-15 10:50:33,544 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 10:50:33,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:50:33,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 10:50:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 10:50:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 10:50:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 10:50:33,545 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-02-15 10:50:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:33,545 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 10:50:33,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:50:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 10:50:33,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 10:50:33,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 10:50:33,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:33,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:33,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:33,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:33,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:33,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:33,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:34,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:35,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:36,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:37,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:37,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:37,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:37,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:37,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:38,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:39,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:39,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:39,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:39,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:40,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:40,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:40,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:40,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:40,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:40,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:41,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:41,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:41,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:41,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:42,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:42,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:42,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:43,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:43,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:43,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:43,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:50:43,818 WARN L181 SmtUtils]: Spent 10.26 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-02-15 10:50:59,788 WARN L181 SmtUtils]: Spent 15.96 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-02-15 10:50:59,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-15 10:50:59,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-02-15 10:50:59,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-02-15 10:50:59,791 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-02-15 10:50:59,791 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-02-15 10:50:59,792 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse18 (- 1)))) (.cse19 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (= .cse18 0)) (.cse5 (<= 0 .cse19)) (.cse2 (select .cse17 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse3 (= 0 (select .cse10 ULTIMATE.start_main_p1))) (.cse1 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse19 1)))) (or (and (and (and .cse0 .cse1) (<= 1 .cse2) .cse3) (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse5 (<= 0 .cse6) .cse7 (<= .cse8 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (let ((.cse11 (select .cse4 ULTIMATE.start_main_p2))) (let ((.cse14 (<= .cse18 0)) (.cse15 (<= (+ .cse11 1) 0)) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and (= 0 (select .cse9 ULTIMATE.start_main_p1)) (<= 1 (select .cse10 ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse11) .cse0 .cse7) (and (and .cse12 .cse13 .cse14 .cse5 .cse15 .cse3) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p3))) (and (and .cse14 (let ((.cse16 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select .cse17 ULTIMATE.start_main_p1)) .cse12))) (or (and .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse16) (and .cse15 .cse16)))) (<= 0 .cse2))))) (and .cse0 .cse3 .cse1 (= .cse19 0) .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select .cse9 ULTIMATE.start_main_p4) 1) 0)))))) [2019-02-15 10:50:59,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-02-15 10:50:59,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-15 10:50:59,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-02-15 10:50:59,792 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-02-15 10:50:59,792 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-02-15 10:50:59,808 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:50:59 BoogieIcfgContainer [2019-02-15 10:50:59,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 10:50:59,809 INFO L168 Benchmark]: Toolchain (without parser) took 88623.15 ms. Allocated memory was 143.1 MB in the beginning and 771.2 MB in the end (delta: 628.1 MB). Free memory was 110.6 MB in the beginning and 491.9 MB in the end (delta: -381.2 MB). Peak memory consumption was 687.4 MB. Max. memory is 7.1 GB. [2019-02-15 10:50:59,809 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 143.1 MB. Free memory is still 111.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:50:59,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.15 ms. Allocated memory is still 143.1 MB. Free memory was 110.4 MB in the beginning and 108.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-15 10:50:59,810 INFO L168 Benchmark]: Boogie Preprocessor took 23.38 ms. Allocated memory is still 143.1 MB. Free memory was 108.2 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-15 10:50:59,810 INFO L168 Benchmark]: RCFGBuilder took 292.65 ms. Allocated memory is still 143.1 MB. Free memory was 107.1 MB in the beginning and 96.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-02-15 10:50:59,811 INFO L168 Benchmark]: TraceAbstraction took 88250.69 ms. Allocated memory was 143.1 MB in the beginning and 771.2 MB in the end (delta: 628.1 MB). Free memory was 96.3 MB in the beginning and 491.9 MB in the end (delta: -395.6 MB). Peak memory consumption was 673.1 MB. Max. memory is 7.1 GB. [2019-02-15 10:50:59,812 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 143.1 MB. Free memory is still 111.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.15 ms. Allocated memory is still 143.1 MB. Free memory was 110.4 MB in the beginning and 108.2 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.38 ms. Allocated memory is still 143.1 MB. Free memory was 108.2 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 292.65 ms. Allocated memory is still 143.1 MB. Free memory was 107.1 MB in the beginning and 96.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88250.69 ms. Allocated memory was 143.1 MB in the beginning and 771.2 MB in the end (delta: 628.1 MB). Free memory was 96.3 MB in the beginning and 491.9 MB in the end (delta: -395.6 MB). Peak memory consumption was 673.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((p1 + 3 <= p4 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2)) || ((((((0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p2 == p4)) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && p1 + 3 <= p4) && #memory_int[p4] == 0) || ((((((!(p1 == p4) && !(p1 == p3)) && #memory_int[p4] <= 0) && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && !(p4 == p3))) || ((#memory_int[p4] <= 0 && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)))) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3])) || ((((((p1 + 3 <= p4 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 88.1s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.9s AutomataDifference, 0.0s DeadEndRemovalTime, 26.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 15.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...