java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:38:24,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:38:24,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:38:24,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:38:24,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:38:24,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:38:24,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:38:24,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:38:24,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:38:24,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:38:24,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:38:24,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:38:24,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:38:24,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:38:24,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:38:24,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:38:24,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:38:24,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:38:24,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:38:24,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:38:24,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:38:24,110 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:38:24,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:38:24,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:38:24,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:38:24,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:38:24,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:38:24,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:38:24,120 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:38:24,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:38:24,124 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:38:24,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:38:24,125 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:38:24,125 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:38:24,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:38:24,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:38:24,128 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-18 17:38:24,151 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:38:24,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:38:24,152 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:38:24,152 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:38:24,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:38:24,152 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:38:24,153 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:38:24,153 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:38:24,153 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:38:24,153 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:38:24,153 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:38:24,156 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:38:24,156 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:38:24,156 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:38:24,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:38:24,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:38:24,158 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:38:24,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:38:24,160 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:38:24,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:38:24,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:38:24,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:38:24,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:38:24,161 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:38:24,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:38:24,161 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:38:24,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:38:24,162 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:38:24,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:38:24,162 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:38:24,162 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:38:24,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:38:24,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:38:24,163 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:38:24,163 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:38:24,163 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:38:24,163 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:38:24,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:38:24,164 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:38:24,164 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:38:24,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:38:24,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:38:24,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:38:24,238 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:38:24,238 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:38:24,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-18 17:38:24,239 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-18 17:38:24,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:38:24,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:38:24,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:38:24,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:38:24,287 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:38:24,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:38:24,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:38:24,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:38:24,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:38:24,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/1) ... [2019-01-18 17:38:24,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:38:24,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:38:24,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:38:24,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:38:24,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (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-01-18 17:38:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:38:24,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:38:24,718 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:38:24,719 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-18 17:38:24,721 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:38:24 BoogieIcfgContainer [2019-01-18 17:38:24,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:38:24,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:38:24,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:38:24,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:38:24,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:24" (1/2) ... [2019-01-18 17:38:24,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604fad5a and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:38:24, skipping insertion in model container [2019-01-18 17:38:24,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:38:24" (2/2) ... [2019-01-18 17:38:24,732 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-18 17:38:24,742 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:38:24,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-18 17:38:24,769 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-18 17:38:24,802 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:38:24,803 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:38:24,803 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:38:24,803 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:38:24,803 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:38:24,803 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:38:24,804 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:38:24,804 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:38:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-18 17:38:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 17:38:24,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:24,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 17:38:24,840 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:24,847 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-18 17:38:24,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:24,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:25,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:38:25,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:38:25,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:38:25,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:38:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:38:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:38:25,057 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-18 17:38:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:25,349 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-18 17:38:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:38:25,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 17:38:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:25,365 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:38:25,365 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:38:25,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:38:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:38:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-18 17:38:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:38:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-18 17:38:25,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-18 17:38:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:25,407 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-18 17:38:25,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:38:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-18 17:38:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:25,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:25,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:25,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-18 17:38:25,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:25,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:25,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:25,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:25,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:25,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:25,550 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:38:25,552 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-18 17:38:25,591 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:25,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:25,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:25,685 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:25,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:25,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:25,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:25,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:25,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:25,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:25,917 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-18 17:38:25,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:26,068 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-18 17:38:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:26,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:26,372 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-18 17:38:26,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:26,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:26,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:26,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:26,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:26,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:26,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:26,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:26,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:26,688 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,752 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,796 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:26,879 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:27,020 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-18 17:38:27,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:27,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:38:27,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:27,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:27,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:27,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:27,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:27,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:38:27,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:27,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:38:27,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:38:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:27,523 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-18 17:38:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:27,870 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-18 17:38:27,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:38:27,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:38:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:27,872 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:38:27,872 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:38:27,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:38:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:38:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-18 17:38:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:38:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-18 17:38:27,880 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-18 17:38:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:27,880 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-18 17:38:27,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:38:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-18 17:38:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:27,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:27,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:27,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-18 17:38:27,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:27,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:27,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:28,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:28,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:28,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:38:28,049 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-18 17:38:28,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:28,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:28,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:28,059 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:28,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:28,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:28,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:28,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:28,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:28,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:28,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:28,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:28,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:28,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:28,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:28,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:28,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:28,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:28,331 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,363 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,389 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,413 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,430 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:28,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:28,490 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:28,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:28,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:38:28,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 17:38:28,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-18 17:38:28,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:183 [2019-01-18 17:38:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:28,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:29,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:38:29,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:38:29,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:38:29,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:38:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:38:29,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:38:29,011 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-18 17:38:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:29,059 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-18 17:38:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:38:29,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 17:38:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:29,062 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:38:29,062 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:38:29,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:38:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:38:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:38:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:38:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-18 17:38:29,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-18 17:38:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:29,067 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-18 17:38:29,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:38:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-18 17:38:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:29,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:29,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:29,069 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-18 17:38:29,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:29,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:29,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:29,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:38:29,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:38:29,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:38:29,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:38:29,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:38:29,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:38:29,099 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-18 17:38:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:29,193 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-18 17:38:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:38:29,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 17:38:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:29,195 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:38:29,195 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:38:29,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:38:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:38:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-18 17:38:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:38:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-18 17:38:29,200 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-18 17:38:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:29,201 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-18 17:38:29,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:38:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-18 17:38:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:29,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:29,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:29,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:29,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:29,203 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-18 17:38:29,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:29,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:29,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:29,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:29,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:29,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:29,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:29,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:38:29,263 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-18 17:38:29,266 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:29,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:29,272 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:29,273 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:29,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:29,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:29,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:29,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:29,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:29,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:29,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:29,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:29,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:29,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:29,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:29,451 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:29,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:29,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:29,642 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,655 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,664 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:29,690 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:29,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:38:29,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:29,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:29,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:29,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:29,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:38:29,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:29,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:38:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:38:29,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:29,835 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-18 17:38:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:30,052 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-18 17:38:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:38:30,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:38:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:30,056 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:38:30,056 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 17:38:30,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:38:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 17:38:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-18 17:38:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:38:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-18 17:38:30,063 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-18 17:38:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:30,064 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-18 17:38:30,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:38:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-18 17:38:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:30,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:30,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:30,065 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-18 17:38:30,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:30,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:30,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:30,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:30,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:30,148 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:30,149 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-18 17:38:30,150 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:30,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:30,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:30,157 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:30,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:30,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:30,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:30,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:30,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:30,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:30,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:30,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:30,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:30,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:30,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:30,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:30,588 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-18 17:38:30,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:30,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:30,630 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,685 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:30,709 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:30,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-18 17:38:30,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:38:30,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:38:30,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-18 17:38:31,070 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-18 17:38:31,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 17:38:31,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-18 17:38:31,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:31,519 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:31,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-18 17:38:31,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:31,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-18 17:38:31,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-18 17:38:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:31,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:31,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:31,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:31,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:31,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:31,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:31,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:31,938 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-18 17:38:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:32,436 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-18 17:38:32,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:38:32,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:32,438 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:38:32,438 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:38:32,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:38:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:38:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-18 17:38:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:38:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-18 17:38:32,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-18 17:38:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:32,446 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-18 17:38:32,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-18 17:38:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:32,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:32,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:32,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-18 17:38:32,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:32,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:32,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:32,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:32,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:32,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:32,522 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-18 17:38:32,525 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:32,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:32,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:32,535 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:32,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:32,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:32,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:32,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:32,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:32,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:32,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:32,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:38:32,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:38:32,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:38:32,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:38:32,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:38:32,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:38:32,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:38:32,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,817 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,825 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:32,844 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 17:38:32,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:32,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-18 17:38:32,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:32,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:32,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-18 17:38:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:32,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:32,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:38:32,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:38:32,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:38:32,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:38:32,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:38:32,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:32,976 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-18 17:38:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:33,072 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-18 17:38:33,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:38:33,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:38:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:33,073 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:38:33,074 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:38:33,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:38:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-18 17:38:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:38:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-18 17:38:33,086 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-18 17:38:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:33,086 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-18 17:38:33,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:38:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-18 17:38:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:33,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:33,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:33,089 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-18 17:38:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:33,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:33,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:33,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:33,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:33,238 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-18 17:38:33,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:33,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:33,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:33,245 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:33,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:33,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:33,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:33,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:33,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:33,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:33,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:33,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:33,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:33,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:33,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:33,318 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:33,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:33,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:33,505 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,521 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:33,542 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:33,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:38:33,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:33,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:33,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,696 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:33,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-18 17:38:33,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:33,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-18 17:38:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:33,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:33,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:33,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:33,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:33,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:33,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:33,790 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-18 17:38:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:34,238 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-18 17:38:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:38:34,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:34,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:34,240 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:38:34,240 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:38:34,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:38:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-18 17:38:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:38:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-18 17:38:34,249 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-18 17:38:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:34,250 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-18 17:38:34,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-18 17:38:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:34,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:34,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:34,251 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-18 17:38:34,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:34,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:34,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:34,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:34,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:34,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:34,334 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-18 17:38:34,336 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:34,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:34,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:34,343 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:34,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:34,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:34,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:34,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:34,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:34,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:34,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:34,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:34,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:34,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:34,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:34,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:34,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:34,517 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,536 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,566 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:34,601 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:34,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:38:34,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:34,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:38:34,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,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-01-18 17:38:34,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 17:38:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:34,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:34,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:34,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:34,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:34,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:34,798 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-18 17:38:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:35,191 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-18 17:38:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:38:35,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:35,192 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:38:35,192 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:38:35,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:38:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-18 17:38:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:38:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-18 17:38:35,201 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-18 17:38:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:35,201 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-18 17:38:35,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-18 17:38:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:35,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:35,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:35,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-18 17:38:35,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:35,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:35,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:35,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:35,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:35,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:35,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:35,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:35,243 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-18 17:38:35,244 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:35,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:35,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:35,248 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:35,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:35,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:35,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:35,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:35,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:35,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:35,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:35,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:38:35,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:38:35,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:38:35,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:38:35,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:38:35,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:38:35,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:38:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:38:35,573 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,590 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,603 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:35,673 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 17:38:35,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:35,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:38:35,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:35,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:35,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-18 17:38:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:35,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:35,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:35,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:38:35,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:35,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:38:35,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:38:35,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:35,818 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-18 17:38:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:35,946 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-18 17:38:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:38:35,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:38:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:35,948 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:38:35,948 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:38:35,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:38:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:38:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-18 17:38:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:38:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-18 17:38:35,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-18 17:38:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:35,957 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-18 17:38:35,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:38:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-18 17:38:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:35,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:35,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:35,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-18 17:38:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:35,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:36,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:36,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:36,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:36,067 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-18 17:38:36,068 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:36,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:36,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:36,072 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:36,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:36,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:36,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:36,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:36,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:36,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:36,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:36,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:36,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:36,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:36,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:36,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:36,171 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,220 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:38:36,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:38:36,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:38:36,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:38:36,389 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,405 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,420 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,435 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:36,463 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 17:38:36,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:38:36,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:36,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 17:38:36,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:36,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:38:36,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:36,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:36,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-18 17:38:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:36,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:36,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:36,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:36,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:36,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:36,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:36,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:36,659 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-18 17:38:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:37,018 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-18 17:38:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:38:37,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:37,020 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:38:37,020 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:38:37,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:38:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-18 17:38:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:38:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-18 17:38:37,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-18 17:38:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:37,030 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-18 17:38:37,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-18 17:38:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:37,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:37,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:37,031 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-18 17:38:37,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:37,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:37,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:37,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:37,131 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-18 17:38:37,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:37,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:37,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:37,136 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:37,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:37,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:37,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:37,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:37,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:37,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:37,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:37,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:37,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:37,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:37,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:37,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:37,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:37,309 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,325 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:37,380 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:37,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:38:37,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:37,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:37,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 17:38:37,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:37,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 17:38:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:37,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:37,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:37,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:38:37,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:37,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:37,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:38:37,530 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-18 17:38:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:37,809 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-18 17:38:37,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:38:37,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:37,810 INFO L225 Difference]: With dead ends: 63 [2019-01-18 17:38:37,811 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:38:37,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:38:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:38:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-18 17:38:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:38:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-18 17:38:37,821 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-18 17:38:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:37,821 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-18 17:38:37,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-18 17:38:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:37,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:37,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:37,823 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:37,823 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-18 17:38:37,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:37,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:37,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:38:37,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:38:37,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:38:37,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:38:37,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:38:37,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:38:37,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:38:37,859 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-18 17:38:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:37,968 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-18 17:38:37,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:38:37,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:38:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:37,970 INFO L225 Difference]: With dead ends: 41 [2019-01-18 17:38:37,970 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:38:37,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:38:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:38:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-18 17:38:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:38:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-18 17:38:37,980 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-18 17:38:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:37,980 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-18 17:38:37,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:38:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-18 17:38:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:37,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:37,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:37,982 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-18 17:38:37,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:38,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:38,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:38,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:38,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:38,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:38,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:38,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:38,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:38,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:38:38,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:38,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:38,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:38,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:38,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:38,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:38,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:38,119 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:38:38,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:38:38,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:38:38,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:38:38,359 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,376 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,411 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:38,444 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 17:38:38,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:38:38,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:38,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 17:38:38,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:38,929 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:38,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-18 17:38:38,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:38,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:38,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-18 17:38:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:38,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:39,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:39,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:39,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:39,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:39,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:39,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:39,035 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-18 17:38:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:39,415 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-18 17:38:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:38:39,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:39,417 INFO L225 Difference]: With dead ends: 57 [2019-01-18 17:38:39,417 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:38:39,417 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-01-18 17:38:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:38:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-18 17:38:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:38:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-18 17:38:39,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-18 17:38:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:39,428 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-18 17:38:39,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-18 17:38:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:39,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:39,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:39,429 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-18 17:38:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:39,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:39,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:39,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:39,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:39,700 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:39,700 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-18 17:38:39,701 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:39,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:39,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:39,706 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:39,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:39,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:39,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:39,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:39,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:39,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:39,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:39,877 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-18 17:38:39,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:39,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:40,222 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-18 17:38:40,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:40,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:40,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:40,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:40,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:40,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:40,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:40,423 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,449 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,473 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,488 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:40,529 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:40,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:38:40,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:40,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:40,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:40,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:38:40,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:40,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:40,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 17:38:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:40,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:40,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:38:40,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:40,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:38:40,722 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-18 17:38:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:41,046 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-18 17:38:41,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:38:41,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:41,047 INFO L225 Difference]: With dead ends: 61 [2019-01-18 17:38:41,047 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 17:38:41,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 17:38:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-18 17:38:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:38:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-18 17:38:41,059 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-18 17:38:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:41,059 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-18 17:38:41,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-18 17:38:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:41,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:41,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:41,060 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-18 17:38:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:41,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:41,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:41,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:41,132 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:41,132 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-18 17:38:41,134 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:41,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:41,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:41,137 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:41,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:41,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:41,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:41,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:41,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:41,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:41,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:41,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:38:41,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:38:41,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:38:41,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:38:41,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:38:41,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:38:41,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:38:41,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:38:41,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,414 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,428 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,443 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:41,527 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 17:38:41,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:38:41,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:41,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-18 17:38:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:41,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:41,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:41,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:38:41,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:41,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:38:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:38:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:41,630 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-18 17:38:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:41,766 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-18 17:38:41,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:38:41,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:38:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:41,767 INFO L225 Difference]: With dead ends: 53 [2019-01-18 17:38:41,767 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 17:38:41,768 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-01-18 17:38:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 17:38:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-18 17:38:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:38:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-18 17:38:41,779 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-18 17:38:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:41,779 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-18 17:38:41,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:38:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-18 17:38:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:41,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:41,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:41,781 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-18 17:38:41,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:41,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:41,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:41,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:41,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:41,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:41,863 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-18 17:38:41,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:41,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:41,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:41,867 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:41,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:41,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:41,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:41,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:41,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:41,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:41,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:41,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:41,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:41,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:41,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:41,956 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:38:42,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:38:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:38:42,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:38:42,193 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,208 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,224 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,239 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:42,308 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 17:38:42,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:38:42,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:42,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 17:38:42,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:42,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:38:42,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:42,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:42,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-18 17:38:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:42,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:42,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:42,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:42,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:42,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:42,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:42,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:42,522 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-18 17:38:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:43,045 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-18 17:38:43,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:38:43,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:38:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:43,046 INFO L225 Difference]: With dead ends: 69 [2019-01-18 17:38:43,046 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:38:43,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:38:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-18 17:38:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:38:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-18 17:38:43,059 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-18 17:38:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:43,059 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-18 17:38:43,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-18 17:38:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:43,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:43,060 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 17:38:43,060 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-18 17:38:43,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:43,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:43,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:43,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:43,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:38:43,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:43,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:43,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:43,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:43,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:43,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:43,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:43,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:43,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:38:43,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:43,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:43,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:43,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:43,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:43,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:43,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:43,250 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:38:43,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:38:43,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:38:43,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:38:43,661 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,676 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,691 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,707 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:43,736 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-18 17:38:43,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:38:43,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:43,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 17:38:43,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-18 17:38:43,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:43,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-18 17:38:43,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:43,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 17:38:43,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:43,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:43,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-18 17:38:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:43,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:43,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:43,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-18 17:38:43,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:43,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:38:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:38:43,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:38:43,971 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-18 17:38:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:44,329 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-18 17:38:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:38:44,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 17:38:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:44,333 INFO L225 Difference]: With dead ends: 73 [2019-01-18 17:38:44,333 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:38:44,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:38:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-18 17:38:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 17:38:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-18 17:38:44,346 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-18 17:38:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:44,346 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-18 17:38:44,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:38:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-18 17:38:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:44,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:44,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:44,348 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:44,348 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-18 17:38:44,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:44,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:44,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:44,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:44,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:44,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:44,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:44,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:38:44,432 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-18 17:38:44,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:44,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:44,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:44,437 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:44,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:44,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:44,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:44,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:44,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:44,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:44,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:44,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:38:44,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:38:44,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:38:44,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:38:44,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:38:44,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:38:44,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:38:44,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:38:44,708 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,721 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,734 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,749 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:44,776 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:38:44,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 17:38:44,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:44,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:38:44,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:44,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-18 17:38:44,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:44,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:44,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-18 17:38:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:44,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:45,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:45,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:38:45,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:45,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:38:45,018 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-18 17:38:45,451 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-18 17:38:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:45,652 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-18 17:38:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:38:45,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:38:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:45,654 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:38:45,654 INFO L226 Difference]: Without dead ends: 78 [2019-01-18 17:38:45,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:38:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-18 17:38:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-18 17:38:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:38:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-18 17:38:45,671 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-18 17:38:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:45,671 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-18 17:38:45,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-18 17:38:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:45,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:45,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:45,673 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-18 17:38:45,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:45,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:45,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:45,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-01-18 17:38:45,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:45,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:45,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:38:45,788 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-18 17:38:45,789 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:45,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:45,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:45,793 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:38:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:45,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:45,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:45,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:45,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:45,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:45,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:45,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:45,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:45,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:45,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:45,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:45,887 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:46,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:46,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:46,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:46,049 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:46,058 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:46,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:46,079 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:46,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-18 17:38:46,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:38:46,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:38:46,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-18 17:38:46,697 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-18 17:38:46,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:46,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:47,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:47,006 INFO L303 Elim1Store]: Index analysis took 304 ms [2019-01-18 17:38:47,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 17:38:47,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-18 17:38:48,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,125 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:48,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-18 17:38:48,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-18 17:38:48,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-18 17:38:48,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:48,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-01-18 17:38:48,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-01-18 17:38:48,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,629 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:48,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-18 17:38:48,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:48,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-18 17:38:48,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-18 17:38:48,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-18 17:38:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:48,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:48,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:48,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:38:48,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:48,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:38:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:38:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:38:48,952 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-18 17:38:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:49,840 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-18 17:38:49,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:38:49,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:38:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:49,843 INFO L225 Difference]: With dead ends: 109 [2019-01-18 17:38:49,843 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:38:49,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:38:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:38:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-18 17:38:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:38:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-18 17:38:49,858 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-18 17:38:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:49,858 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-18 17:38:49,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:38:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-18 17:38:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:49,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:49,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:49,859 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-18 17:38:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:49,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:49,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:50,055 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-18 17:38:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:38:50,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:50,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:50,069 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:38:50,069 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-18 17:38:50,071 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:50,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:50,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:50,075 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:50,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:50,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:50,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:50,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:50,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:50,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:50,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:50,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:50,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:50,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:50,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,153 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:50,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:50,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:50,268 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,277 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,286 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:50,308 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:50,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:38:50,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:50,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:50,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:38:50,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:50,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 17:38:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:50,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:50,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:50,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:50,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:50,588 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-18 17:38:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:50,989 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-18 17:38:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:38:50,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:38:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:50,991 INFO L225 Difference]: With dead ends: 77 [2019-01-18 17:38:50,991 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 17:38:50,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:38:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 17:38:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-18 17:38:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 17:38:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-18 17:38:51,010 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-18 17:38:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:51,010 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-18 17:38:51,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-18 17:38:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:51,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:51,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:51,012 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-18 17:38:51,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:51,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:51,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:51,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:51,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:51,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:51,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:51,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:51,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:51,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:51,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:38:51,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:51,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:38:51,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:38:51,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:38:51,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:38:51,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:51,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:51,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:51,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:51,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:51,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,425 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,438 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,449 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,459 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:51,488 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:38:51,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:38:51,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:51,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:38:51,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,582 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:51,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-18 17:38:51,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:51,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-18 17:38:51,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-18 17:38:51,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:51,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-18 17:38:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:51,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:51,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:38:51,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:51,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:38:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:38:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:51,773 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-18 17:38:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:52,304 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-18 17:38:52,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:38:52,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:38:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:52,308 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:38:52,308 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:38:52,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:38:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:38:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-18 17:38:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:38:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-18 17:38:52,325 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-18 17:38:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:52,325 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-18 17:38:52,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:38:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-18 17:38:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:52,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:52,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:52,327 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-18 17:38:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:52,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:52,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:52,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:52,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:52,661 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:38:52,662 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-18 17:38:52,663 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:52,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:52,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:52,670 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:52,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:52,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:52,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:52,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:52,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:52,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:52,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:52,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:52,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:38:52,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:38:52,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:38:52,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:38:52,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:38:52,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:38:52,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:38:52,877 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,885 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,894 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:52,913 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 17:38:52,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:38:52,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:52,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 17:38:52,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 17:38:52,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:52,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-18 17:38:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:53,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:53,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:53,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:53,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:53,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:53,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:53,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:53,044 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-18 17:38:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:53,304 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-18 17:38:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:38:53,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:38:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:53,306 INFO L225 Difference]: With dead ends: 81 [2019-01-18 17:38:53,306 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 17:38:53,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 17:38:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-18 17:38:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:38:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-18 17:38:53,322 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-18 17:38:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:53,322 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-18 17:38:53,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-18 17:38:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:53,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:53,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:53,323 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-18 17:38:53,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:53,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:53,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:53,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:53,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:38:53,526 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-18 17:38:53,527 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:53,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:53,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:53,531 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:38:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:53,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:53,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:53,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:53,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:53,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:53,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:53,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:53,737 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-18 17:38:53,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:53,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:53,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:53,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:53,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:53,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:53,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:53,831 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,862 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,873 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:53,905 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:53,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:38:53,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:53,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:38:53,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:53,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:38:53,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,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-01-18 17:38:54,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 17:38:54,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,070 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:54,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-18 17:38:54,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:54,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 17:38:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:54,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:54,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:54,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:38:54,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:54,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:38:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:38:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:54,181 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-18 17:38:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:54,653 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-18 17:38:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:38:54,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:38:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:54,655 INFO L225 Difference]: With dead ends: 113 [2019-01-18 17:38:54,655 INFO L226 Difference]: Without dead ends: 112 [2019-01-18 17:38:54,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:38:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-18 17:38:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-18 17:38:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 17:38:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-18 17:38:54,678 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-18 17:38:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:54,678 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-18 17:38:54,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:38:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-18 17:38:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:54,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:54,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:54,680 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-18 17:38:54,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:54,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:54,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:54,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:54,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:54,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:38:54,794 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-18 17:38:54,800 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:54,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:54,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:54,805 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:38:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:54,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:54,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:54,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:54,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:54,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:54,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:54,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:54,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:54,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:54,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:54,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:54,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:38:55,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:38:55,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:38:55,041 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,051 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,060 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:55,081 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:38:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:38:55,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 17:38:55,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-18 17:38:55,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-01-18 17:38:55,459 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-01-18 17:38:55,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,468 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:55,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 43 treesize of output 51 [2019-01-18 17:38:55,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2019-01-18 17:38:55,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 17:38:55,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-18 17:38:55,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:96 [2019-01-18 17:38:57,829 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 65 [2019-01-18 17:38:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-18 17:38:57,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,895 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:57,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 17:38:57,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-18 17:38:57,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:58,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-18 17:38:58,027 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-18 17:38:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:58,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:58,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:58,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-18 17:38:58,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:58,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:38:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:38:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:38:58,182 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-18 17:38:58,738 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-01-18 17:38:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:59,197 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-18 17:38:59,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:38:59,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:38:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:59,200 INFO L225 Difference]: With dead ends: 137 [2019-01-18 17:38:59,200 INFO L226 Difference]: Without dead ends: 136 [2019-01-18 17:38:59,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:38:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-18 17:38:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-18 17:38:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 17:38:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-18 17:38:59,231 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-18 17:38:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:59,232 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-18 17:38:59,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:38:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-18 17:38:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:38:59,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:59,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:38:59,233 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-18 17:38:59,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:59,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:59,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:38:59,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:59,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:59,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:38:59,329 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-18 17:38:59,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:59,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:59,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:59,333 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:59,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:59,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:59,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:59,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:59,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:59,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:59,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:38:59,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:38:59,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:38:59,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:38:59,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:59,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:59,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:38:59,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:59,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:59,603 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,626 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,640 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,651 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:59,691 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 17:38:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:38:59,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:59,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 17:38:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:59,782 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:59,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:38:59,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:59,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-18 17:38:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:59,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:59,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:59,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:59,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:59,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:59,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:59,899 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-18 17:39:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:00,223 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-18 17:39:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:00,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:39:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:00,225 INFO L225 Difference]: With dead ends: 120 [2019-01-18 17:39:00,226 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 17:39:00,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 17:39:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-18 17:39:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 17:39:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-18 17:39:00,261 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-18 17:39:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:00,262 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-18 17:39:00,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-18 17:39:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:39:00,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:00,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:39:00,263 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-18 17:39:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:00,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:00,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:00,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:39:00,321 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-18 17:39:00,324 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:00,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:00,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:00,328 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:39:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:00,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:00,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:00,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:00,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:00,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:00,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:00,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:00,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:00,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:00,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:39:00,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,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 43 treesize of output 39 [2019-01-18 17:39:00,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:00,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:00,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:00,579 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,593 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,607 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:00,665 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:00,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:39:00,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:00,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-18 17:39:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:00,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:00,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:39:00,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:39:00,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:39:00,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:39:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:39:00,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:39:00,902 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-18 17:39:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:01,031 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-18 17:39:01,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:39:01,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:39:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:01,033 INFO L225 Difference]: With dead ends: 105 [2019-01-18 17:39:01,033 INFO L226 Difference]: Without dead ends: 104 [2019-01-18 17:39:01,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:39:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-18 17:39:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-18 17:39:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 17:39:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-18 17:39:01,068 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-18 17:39:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:01,068 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-18 17:39:01,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:39:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-18 17:39:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:39:01,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:01,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:39:01,069 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:01,069 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-18 17:39:01,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:01,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:01,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:01,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:01,614 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-18 17:39:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:01,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:01,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:01,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:01,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:01,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:01,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:01,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:39:01,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:39:01,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:39:01,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:01,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:01,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:01,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:01,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:01,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:01,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:01,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:39:02,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:39:02,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:39:02,038 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,066 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:02,087 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 17:39:02,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:39:02,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 17:39:02,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-18 17:39:02,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:183 [2019-01-18 17:39:02,441 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-01-18 17:39:02,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-18 17:39:02,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 17:39:02,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 17:39:02,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,720 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:02,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-18 17:39:02,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-18 17:39:02,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:173, output treesize:121 [2019-01-18 17:39:02,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-01-18 17:39:02,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:02,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:02,933 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:02,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-18 17:39:02,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:03,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,021 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:03,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-18 17:39:03,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:03,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:03,103 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:03,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-01-18 17:39:03,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:03,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-18 17:39:03,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-18 17:39:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:03,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:03,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:03,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:39:03,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:03,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:03,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:03,306 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-18 17:39:03,716 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-18 17:39:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:04,587 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-18 17:39:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:04,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:39:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:04,590 INFO L225 Difference]: With dead ends: 131 [2019-01-18 17:39:04,590 INFO L226 Difference]: Without dead ends: 130 [2019-01-18 17:39:04,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:39:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-18 17:39:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-18 17:39:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:39:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-18 17:39:04,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-18 17:39:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:04,619 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-18 17:39:04,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-18 17:39:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:39:04,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:04,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:39:04,620 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:04,621 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-18 17:39:04,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:04,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:04,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:04,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:04,848 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-18 17:39:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:04,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:04,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:04,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:39:04,863 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-18 17:39:04,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:04,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:04,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:04,869 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:04,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:04,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:04,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:04,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:04,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:04,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:04,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:04,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:04,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:04,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:04,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:39:04,920 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:39:05,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,165 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-01-18 17:39:05,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:05,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:05,274 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:05,287 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:05,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:05,315 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:05,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:05,342 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:05,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:39:05,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:05,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:05,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:39:05,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:05,474 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:05,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-01-18 17:39:05,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:05,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:05,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-18 17:39:05,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-01-18 17:39:05,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:05,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:05,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:05,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:05,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:05,574 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-18 17:39:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:06,072 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-18 17:39:06,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:06,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:39:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:06,073 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:39:06,073 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:39:06,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:39:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-18 17:39:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:39:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-18 17:39:06,097 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-18 17:39:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:06,097 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-18 17:39:06,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-18 17:39:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:39:06,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:06,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:39:06,098 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-18 17:39:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:06,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:06,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:06,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:06,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:06,177 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:39:06,177 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-18 17:39:06,178 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:06,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:06,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:06,181 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:06,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:06,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:06,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:06,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:06,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:06,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:06,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:06,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:39:06,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:39:06,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:39:06,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:06,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39: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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:06,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:06,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:06,319 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,359 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,371 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:06,411 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 17:39:06,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:39:06,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:06,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 17:39:06,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 17:39:06,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:06,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 17:39:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:06,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:06,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:39:06,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:06,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:39:06,542 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-18 17:39:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:06,793 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-18 17:39:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:39:06,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:39:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:06,794 INFO L225 Difference]: With dead ends: 73 [2019-01-18 17:39:06,795 INFO L226 Difference]: Without dead ends: 72 [2019-01-18 17:39:06,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-18 17:39:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-18 17:39:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:39:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-18 17:39:06,820 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-18 17:39:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:06,821 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-18 17:39:06,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-18 17:39:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:39:06,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:06,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:39:06,821 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-18 17:39:06,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:06,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:06,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:06,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:06,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:39:06,911 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-18 17:39:06,912 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:06,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:06,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:06,916 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:06,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:06,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:06,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:06,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:06,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:06,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:06,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:06,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:06,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:06,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:06,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:06,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:06,973 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:39:07,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:39:07,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:39:07,114 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,124 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,131 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:07,153 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:39:07,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:39:07,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,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-01-18 17:39:07,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 17:39:07,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:07,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 17:39:07,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:07,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-18 17:39:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:07,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:07,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:07,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-18 17:39:07,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:07,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:39:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:39:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:07,309 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-18 17:39:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:07,535 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-18 17:39:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:07,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 17:39:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:07,537 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:39:07,537 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:39:07,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:39:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:39:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-18 17:39:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:39:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-18 17:39:07,565 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-18 17:39:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:07,566 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-18 17:39:07,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:39:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-18 17:39:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:39:07,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:07,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:39:07,566 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:07,567 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-18 17:39:07,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:07,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:07,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:07,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:07,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:07,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:39:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:39:07,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:39:07,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:39:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:39:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:39:07,701 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-18 17:39:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:07,766 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-18 17:39:07,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:39:07,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:39:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:07,767 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:39:07,768 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:39:07,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:39:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:39:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-18 17:39:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:39:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-18 17:39:07,796 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-18 17:39:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:07,796 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-18 17:39:07,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:39:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-18 17:39:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:39:07,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:07,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:39:07,797 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-18 17:39:07,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:07,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:07,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:07,984 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-18 17:39:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:07,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:07,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:07,995 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:39:07,995 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-18 17:39:07,996 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:07,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:07,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:07,999 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:08,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:08,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:08,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:08,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:08,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:08,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:08,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:39:08,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:39:08,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:39:08,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:08,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:08,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:08,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:08,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:39:08,111 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,124 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,136 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,155 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:08,181 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 17:39:08,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:39:08,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:39:08,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:39:08,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-18 17:39:08,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 17:39:08,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:08,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-18 17:39:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:08,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:08,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:39:08,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:08,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:08,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:39:08,400 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-18 17:39:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:08,637 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-18 17:39:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:39:08,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:39:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:08,638 INFO L225 Difference]: With dead ends: 83 [2019-01-18 17:39:08,638 INFO L226 Difference]: Without dead ends: 82 [2019-01-18 17:39:08,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-18 17:39:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-18 17:39:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 17:39:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-18 17:39:08,680 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-18 17:39:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:08,681 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-18 17:39:08,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-18 17:39:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:08,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:08,681 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 17:39:08,682 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-18 17:39:08,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:08,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:08,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:08,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:08,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:08,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:08,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:08,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:08,781 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-18 17:39:08,782 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:08,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:08,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:08,787 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:39:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:08,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:08,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:08,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:08,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:08,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:08,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:08,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:39:08,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:39:08,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:39:08,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,882 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:08,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:08,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:08,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:08,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:39:08,925 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,939 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,951 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,960 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:08,987 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 17:39:09,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:39:09,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:09,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 17:39:09,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-01-18 17:39:09,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:09,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-18 17:39:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:09,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:09,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:09,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:39:09,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:09,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:09,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:39:09,109 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-18 17:39:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:09,546 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-18 17:39:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:09,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:39:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:09,548 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:39:09,548 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:39:09,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:39:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-18 17:39:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:39:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-18 17:39:09,604 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-18 17:39:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:09,605 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-18 17:39:09,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-18 17:39:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:09,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:09,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:09,606 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-18 17:39:09,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:09,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:09,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:09,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:09,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:09,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:09,676 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-18 17:39:09,677 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:09,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:09,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:09,680 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:39:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:09,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:09,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:09,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:09,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:09,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:09,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:09,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:39:09,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:39:09,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:39:09,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:09,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:39:09,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:09,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:09,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:09,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:09,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:09,926 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,951 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,964 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,975 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:09,984 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:10,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:10,013 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:39:10,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:39:10,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:10,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:10,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:39:10,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 17:39:10,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:10,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:10,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-18 17:39:10,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,218 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:10,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 17:39:10,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:10,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:10,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-18 17:39:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:10,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:10,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:10,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:39:10,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:10,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:39:10,460 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-18 17:39:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:11,009 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-18 17:39:11,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:11,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:39:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:11,010 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:39:11,011 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:39:11,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:39:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-18 17:39:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 17:39:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-18 17:39:11,081 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-18 17:39:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:11,082 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-18 17:39:11,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-18 17:39:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:11,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:11,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:11,082 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:11,083 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-18 17:39:11,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:11,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:11,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:11,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:11,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:11,247 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 17:39:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:11,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:11,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:11,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:11,280 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-18 17:39:11,282 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:11,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:11,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:11,286 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:39:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:11,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:11,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:11,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:11,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:11,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:11,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:11,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:39:11,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:11,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:11,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:11,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:11,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:11,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:11,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:11,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 27 treesize of output 62 [2019-01-18 17:39:11,516 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,538 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,550 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,560 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,570 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:11,597 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:11,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:39:11,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:11,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:39:11,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:39:11,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:11,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 17:39:11,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,733 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:11,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 17:39:11,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:11,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 17:39:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:11,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:11,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:11,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:39:11,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:11,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:11,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:39:11,828 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-18 17:39:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:12,282 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-18 17:39:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:12,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:39:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:12,284 INFO L225 Difference]: With dead ends: 104 [2019-01-18 17:39:12,285 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:39:12,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:39:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-18 17:39:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:39:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-18 17:39:12,385 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-18 17:39:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:12,385 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-18 17:39:12,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-18 17:39:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:12,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:12,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:12,386 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:12,386 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-18 17:39:12,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:12,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:12,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:12,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:12,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:12,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:12,467 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-18 17:39:12,468 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:12,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:12,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:12,471 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:39:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:12,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:12,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:12,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:12,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:12,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:12,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:12,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:39:12,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:39:12,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:39:12,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:12,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:12,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:12,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:12,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:12,612 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:12,690 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 17:39:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:39:12,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:12,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:39:12,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:39:12,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:12,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 17:39:12,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,828 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:12,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 17:39:12,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:12,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 17:39:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:12,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:12,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:12,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:39:12,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:12,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:39:12,924 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-18 17:39:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:13,471 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-18 17:39:13,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:13,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:39:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:13,473 INFO L225 Difference]: With dead ends: 107 [2019-01-18 17:39:13,473 INFO L226 Difference]: Without dead ends: 106 [2019-01-18 17:39:13,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-18 17:39:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-18 17:39:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:39:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-18 17:39:13,568 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-18 17:39:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:13,568 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-18 17:39:13,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-18 17:39:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:13,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:13,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:13,569 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-18 17:39:13,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:13,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:13,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:13,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:13,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:13,642 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-18 17:39:13,642 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:13,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:13,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:13,644 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:13,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:13,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:13,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:13,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:13,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:13,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:13,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:13,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:13,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:13,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:13,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:39:13,707 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:39:13,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:13,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:13,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:13,883 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,897 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,910 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,925 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:13,953 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:39:13,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:14,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 17:39:14,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 17:39:14,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:14,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 17:39:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:14,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:14,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:14,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:14,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:14,115 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-18 17:39:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:14,477 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-18 17:39:14,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:14,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:39:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:14,479 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:39:14,479 INFO L226 Difference]: Without dead ends: 98 [2019-01-18 17:39:14,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-18 17:39:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-18 17:39:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:39:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-18 17:39:14,609 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-18 17:39:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:14,609 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-18 17:39:14,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-18 17:39:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:14,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:14,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:14,610 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-18 17:39:14,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:14,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:14,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:14,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:14,755 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:14,755 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-18 17:39:14,759 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:14,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:14,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:14,761 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:39:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:14,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:14,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:14,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:14,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:14,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:14,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:14,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:39:14,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:39:14,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:14,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:39:14,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:14,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:14,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:14,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:14,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:14,910 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,927 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,940 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,952 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:14,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:14,980 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:39:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:39:15,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 17:39:15,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-18 17:39:15,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-01-18 17:39:15,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,306 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:15,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 67 [2019-01-18 17:39:15,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-18 17:39:15,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:15,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,442 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:15,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-18 17:39:15,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:15,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-18 17:39:15,503 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:92 [2019-01-18 17:39:15,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2019-01-18 17:39:15,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:15,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 17:39:15,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:15,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:15,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:15,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-18 17:39:15,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:15,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-18 17:39:15,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-18 17:39:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:15,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:15,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:15,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:39:15,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:15,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:39:15,863 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-18 17:39:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:16,852 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-18 17:39:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:39:16,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:39:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:16,854 INFO L225 Difference]: With dead ends: 124 [2019-01-18 17:39:16,855 INFO L226 Difference]: Without dead ends: 123 [2019-01-18 17:39:16,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:39:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-18 17:39:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-18 17:39:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:39:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-18 17:39:16,965 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-18 17:39:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:16,966 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-18 17:39:16,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-18 17:39:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:16,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:16,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:16,966 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:16,966 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-18 17:39:16,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:16,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:16,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:17,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:17,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:17,091 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:17,091 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-18 17:39:17,092 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:17,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:17,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:17,094 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:39:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:17,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:17,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:17,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:17,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:17,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:17,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:17,263 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-18 17:39:17,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:17,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:17,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:17,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:17,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:17,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,318 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:39:17,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:39:17,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:39:17,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:39:17,503 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,519 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,535 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,551 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:17,582 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:39:17,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:39:17,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:17,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:39:17,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,670 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:17,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:39:17,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:17,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-18 17:39:17,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:17,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:39:17,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:17,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:17,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:17,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:17,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:39:17,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:17,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:39:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:39:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:17,853 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-18 17:39:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:18,654 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-18 17:39:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:18,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 17:39:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:18,656 INFO L225 Difference]: With dead ends: 114 [2019-01-18 17:39:18,656 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 17:39:18,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:39:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 17:39:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-18 17:39:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:39:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-18 17:39:18,779 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-18 17:39:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:18,780 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-18 17:39:18,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:39:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-18 17:39:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:18,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:18,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:18,780 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:18,781 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-18 17:39:18,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:18,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:18,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:18,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:18,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:18,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:18,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:18,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:18,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:18,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:18,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:18,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:18,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:18,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:39:18,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:18,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:18,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:18,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:18,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:18,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:18,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:18,949 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:18,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:18,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,002 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:39:19,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:39:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:39:19,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:39:19,165 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,182 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,197 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,214 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:19,242 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 17:39:19,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:39:19,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:19,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 17:39:19,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:39:19,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:19,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-18 17:39:19,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:19,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:19,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 17:39:19,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:19,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:19,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-18 17:39:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:19,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:19,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:19,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:39:19,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:19,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:19,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:19,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:19,486 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-18 17:39:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:20,081 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-18 17:39:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:39:20,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:39:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:20,084 INFO L225 Difference]: With dead ends: 164 [2019-01-18 17:39:20,084 INFO L226 Difference]: Without dead ends: 163 [2019-01-18 17:39:20,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:39:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-18 17:39:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-18 17:39:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-18 17:39:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-18 17:39:20,293 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-18 17:39:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:20,294 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-18 17:39:20,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-18 17:39:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:20,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:20,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:20,295 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-18 17:39:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:20,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:20,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:20,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:20,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:20,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:20,345 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-18 17:39:20,345 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:20,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:20,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:20,348 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:20,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:20,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:20,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:20,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:20,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:20,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:20,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:20,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:39:20,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:20,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:20,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:20,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:20,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:20,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:20,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:20,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:39:20,555 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,577 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,589 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,599 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:20,636 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:20,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:39:20,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:20,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:20,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:39:20,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:20,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:39:20,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:39:20,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:39:20,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 17:39:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:20,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:20,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:20,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:20,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:20,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:20,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:20,885 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-18 17:39:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:21,365 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-18 17:39:21,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:21,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:39:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:21,368 INFO L225 Difference]: With dead ends: 160 [2019-01-18 17:39:21,368 INFO L226 Difference]: Without dead ends: 159 [2019-01-18 17:39:21,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-18 17:39:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-18 17:39:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-18 17:39:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-18 17:39:21,598 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-18 17:39:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:21,598 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-18 17:39:21,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-18 17:39:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:21,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:21,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:21,599 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-18 17:39:21,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:21,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:21,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:21,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:21,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:21,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:21,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:21,725 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-18 17:39:21,726 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:21,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:21,728 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:21,728 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:21,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:21,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:21,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:21,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:21,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:21,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:21,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:21,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:21,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:21,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:21,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:39:21,776 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:39:21,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:39:21,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:39:21,888 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,897 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,906 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:21,925 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 17:39:21,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:39:21,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:21,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 17:39:21,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:39:21,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:21,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-18 17:39:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:22,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:39:22,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:22,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:39:22,048 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-18 17:39:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:22,743 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-18 17:39:22,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:22,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:39:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:22,746 INFO L225 Difference]: With dead ends: 175 [2019-01-18 17:39:22,746 INFO L226 Difference]: Without dead ends: 174 [2019-01-18 17:39:22,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-18 17:39:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-18 17:39:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 17:39:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-18 17:39:22,985 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-18 17:39:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:22,985 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-18 17:39:22,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-18 17:39:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:22,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:22,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:22,986 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-18 17:39:22,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:22,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:23,136 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:39:23,486 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-18 17:39:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:39:23,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:39:23,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:39:23,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:39:23,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:39:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:39:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:39:23,577 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-18 17:39:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:23,930 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-18 17:39:23,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:39:23,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-18 17:39:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:23,932 INFO L225 Difference]: With dead ends: 185 [2019-01-18 17:39:23,933 INFO L226 Difference]: Without dead ends: 184 [2019-01-18 17:39:23,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:39:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-18 17:39:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-18 17:39:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 17:39:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-18 17:39:24,158 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-18 17:39:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:24,158 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-18 17:39:24,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:39:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-18 17:39:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:24,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:24,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:24,160 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-18 17:39:24,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:24,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:24,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:24,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:24,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:24,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:24,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:24,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:24,214 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-18 17:39:24,215 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:24,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:24,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:24,217 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:24,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:24,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:24,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:24,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:24,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:24,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:24,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:39:24,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:39:24,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:39:24,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:24,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:24,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:24,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:24,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:39:24,342 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,370 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,380 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:24,407 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 17:39:24,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:39:24,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:24,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 17:39:24,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,466 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:24,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-18 17:39:24,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:24,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:39:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:24,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:24,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:24,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:24,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:24,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:24,529 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-18 17:39:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:24,995 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-18 17:39:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:24,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:39:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:24,998 INFO L225 Difference]: With dead ends: 142 [2019-01-18 17:39:24,998 INFO L226 Difference]: Without dead ends: 141 [2019-01-18 17:39:24,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-18 17:39:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-18 17:39:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-18 17:39:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-18 17:39:25,416 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-18 17:39:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:25,416 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-18 17:39:25,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-18 17:39:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:25,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:25,417 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 17:39:25,417 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-18 17:39:25,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:25,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:25,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:25,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:25,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:25,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:25,729 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-18 17:39:25,730 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:25,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:25,732 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:25,732 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:25,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:25,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:25,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:25,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:25,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:25,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:25,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:25,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:25,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:25,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,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 27 treesize of output 62 [2019-01-18 17:39:25,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:25,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:25,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:25,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:25,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:25,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 43 treesize of output 39 [2019-01-18 17:39:25,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:25,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:25,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:25,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:25,995 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,010 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,024 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,040 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:26,068 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:26,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:39:26,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:39:26,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:39:26,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-18 17:39:26,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:39:26,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:26,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-18 17:39:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-18 17:39:26,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:26,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 17:39:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:26,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:26,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:26,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-18 17:39:26,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:26,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:39:26,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:39:26,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:26,403 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-18 17:39:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:27,122 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-18 17:39:27,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:27,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 17:39:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:27,125 INFO L225 Difference]: With dead ends: 219 [2019-01-18 17:39:27,125 INFO L226 Difference]: Without dead ends: 216 [2019-01-18 17:39:27,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-18 17:39:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-18 17:39:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-18 17:39:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-18 17:39:27,402 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-18 17:39:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:27,402 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-18 17:39:27,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:39:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-18 17:39:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:27,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:27,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:27,403 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:27,403 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-18 17:39:27,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:27,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:27,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:27,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:27,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:27,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:27,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:27,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:27,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:27,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:39:27,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:39:27,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:39:27,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:27,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:27,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:39:27,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:39:27,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:39:27,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:27,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:27,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:27,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:27,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:27,629 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,660 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:27,702 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 17:39:27,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-18 17:39:27,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:39:27,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-18 17:39:27,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-18 17:39:27,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 17:39:27,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:39:27,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-18 17:39:27,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:28,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-18 17:39:28,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-18 17:39:28,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,119 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:28,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-18 17:39:28,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-18 17:39:28,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,293 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:28,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-18 17:39:28,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:28,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:28,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-18 17:39:28,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:28,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-18 17:39:28,481 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-18 17:39:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:28,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:28,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:28,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:39:28,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:28,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:28,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:39:28,677 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-18 17:39:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:29,897 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-18 17:39:29,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:29,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:39:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:29,901 INFO L225 Difference]: With dead ends: 218 [2019-01-18 17:39:29,901 INFO L226 Difference]: Without dead ends: 215 [2019-01-18 17:39:29,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:39:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-18 17:39:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-18 17:39:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-18 17:39:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-18 17:39:30,228 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-18 17:39:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:30,228 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-18 17:39:30,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-18 17:39:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:30,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:30,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:30,229 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:30,230 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-18 17:39:30,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:30,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:30,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:30,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:30,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:30,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:30,293 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-18 17:39:30,294 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:30,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:30,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:30,296 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:30,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:30,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:30,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:30,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:30,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:30,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:30,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:39:30,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:30,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:30,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:30,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:30,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:30,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:30,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:30,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:39:30,526 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,864 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,886 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,896 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,907 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:30,936 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:30,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:39:30,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:30,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:39:31,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:31,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:31,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:31,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:31,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:31,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-18 17:39:31,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:31,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:31,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-18 17:39:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:31,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:31,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:31,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:39:31,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:31,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:39:31,096 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-18 17:39:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:31,888 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-18 17:39:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:39:31,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:39:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:31,892 INFO L225 Difference]: With dead ends: 274 [2019-01-18 17:39:31,892 INFO L226 Difference]: Without dead ends: 269 [2019-01-18 17:39:31,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-18 17:39:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-18 17:39:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-18 17:39:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-18 17:39:32,378 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-18 17:39:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:32,378 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-18 17:39:32,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-18 17:39:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:39:32,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:32,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:39:32,380 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:32,380 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-18 17:39:32,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:32,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:32,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:32,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:32,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:39:32,506 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-18 17:39:32,507 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:32,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:32,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:32,509 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:39:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:32,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:32,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:32,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:32,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:32,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:32,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:32,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:32,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:32,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:32,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:32,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:39:32,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,610 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,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 43 treesize of output 39 [2019-01-18 17:39:32,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:32,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:32,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:32,784 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,800 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,814 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:32,859 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:32,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:39:32,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:32,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:32,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:39:32,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:32,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:39:32,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:39:33,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:39:33,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-18 17:39:33,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:33,105 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:33,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-18 17:39:33,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:33,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:33,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-18 17:39:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:33,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:33,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:33,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-18 17:39:33,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:33,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:33,185 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-18 17:39:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:34,727 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-18 17:39:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:39:34,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:39:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:34,732 INFO L225 Difference]: With dead ends: 480 [2019-01-18 17:39:34,732 INFO L226 Difference]: Without dead ends: 477 [2019-01-18 17:39:34,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-18 17:39:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-18 17:39:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-18 17:39:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-18 17:39:35,565 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-18 17:39:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:35,565 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-18 17:39:35,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-18 17:39:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:39:35,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:35,567 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 17:39:35,567 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:35,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-18 17:39:35,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:35,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:35,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:35,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:35,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:35,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:35,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:35,603 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:39:35,603 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-18 17:39:35,604 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:35,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:35,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:35,606 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:39:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:35,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:35,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:35,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:35,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:35,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:35,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:35,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:35,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:35,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:39:35,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 17:39:35,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-18 17:39:35,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:35,722 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-18 17:39:35,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:35,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-18 17:39:35,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-18 17:39:35,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:35,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-18 17:39:35,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:35,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-18 17:39:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:35,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:35,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:39:35,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-18 17:39:35,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:39:35,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:39:35,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:39:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:39:35,765 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-18 17:39:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:37,626 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-18 17:39:37,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:39:37,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-18 17:39:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:37,633 INFO L225 Difference]: With dead ends: 804 [2019-01-18 17:39:37,633 INFO L226 Difference]: Without dead ends: 800 [2019-01-18 17:39:37,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:39:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-18 17:39:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-18 17:39:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-18 17:39:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-18 17:39:39,667 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-18 17:39:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:39,667 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-18 17:39:39,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:39:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-18 17:39:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:39:39,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:39,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:39,670 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-18 17:39:39,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:39,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:39,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:39,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:39,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:39,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:39:39,849 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-18 17:39:39,851 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:39,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:39,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:39,854 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:39:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:39,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:39,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:39,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:39,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:39,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:39,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:39,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:39,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:39,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:39,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:39,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:39,928 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:39,956 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:39,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:39,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:39,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:39:40,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:39:40,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:39:40,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:39:40,140 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,156 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,172 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,189 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,221 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-18 17:39:40,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:39:40,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:40,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-18 17:39:40,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 17:39:40,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:40,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 17:39:40,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,397 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:40,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 17:39:40,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:40,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-18 17:39:40,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:40,496 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:40,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 17:39:40,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:40,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:40,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-18 17:39:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:40,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:40,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:40,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:39:40,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:40,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:39:40,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:39:40,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:40,642 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-18 17:39:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:43,522 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-18 17:39:43,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:39:43,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:39:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:43,529 INFO L225 Difference]: With dead ends: 821 [2019-01-18 17:39:43,530 INFO L226 Difference]: Without dead ends: 820 [2019-01-18 17:39:43,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:39:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-18 17:39:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-18 17:39:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-18 17:39:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-18 17:39:45,391 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-18 17:39:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:45,391 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-18 17:39:45,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:39:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-18 17:39:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:39:45,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:45,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:45,394 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-18 17:39:45,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:45,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:45,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:45,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:45,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:45,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:39:45,511 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-18 17:39:45,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:45,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:45,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:45,514 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:45,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:45,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:45,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:45,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:45,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:45,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:45,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 17:39:45,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-18 17:39:45,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-18 17:39:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-18 17:39:45,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,587 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:45,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:45,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:39:45,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 17:39:45,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:39:45,638 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,653 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,662 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,672 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:45,699 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-18 17:39:45,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 17:39:45,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-18 17:39:45,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:45,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:39:45,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:45,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:45,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-18 17:39:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:45,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:45,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:45,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:45,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:45,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:45,800 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-18 17:39:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:47,849 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-18 17:39:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:47,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:39:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:47,856 INFO L225 Difference]: With dead ends: 805 [2019-01-18 17:39:47,856 INFO L226 Difference]: Without dead ends: 804 [2019-01-18 17:39:47,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-18 17:39:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-18 17:39:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-18 17:39:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-18 17:39:50,009 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-18 17:39:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:50,009 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-18 17:39:50,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-18 17:39:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:39:50,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:50,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:50,012 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-18 17:39:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:50,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:50,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:50,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:50,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:39:50,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:50,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:50,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:39:50,187 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-18 17:39:50,188 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:50,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:50,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:50,191 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:39:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:50,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:50,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:50,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:50,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:50,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:50,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:50,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:50,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:50,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:50,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:50,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:39:50,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,262 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,284 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:39:50,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:39:50,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:39:50,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:39:50,425 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,438 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,452 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,468 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:50,497 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:39:50,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:39:50,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:50,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:39:50,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:39:50,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:50,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 17:39:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,632 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:50,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:50,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-18 17:39:50,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:50,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:50,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 17:39:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:50,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:50,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:39:50,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:50,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:39:50,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:39:50,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:50,748 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-18 17:39:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:53,515 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-18 17:39:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:53,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:39:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:53,525 INFO L225 Difference]: With dead ends: 1004 [2019-01-18 17:39:53,525 INFO L226 Difference]: Without dead ends: 1003 [2019-01-18 17:39:53,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:39:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-18 17:39:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-18 17:39:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-18 17:39:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-18 17:39:55,637 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-18 17:39:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:55,637 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-18 17:39:55,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:39:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-18 17:39:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:39:55,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:55,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:55,639 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-18 17:39:55,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:55,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:55,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:55,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:55,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:55,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:39:55,781 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-18 17:39:55,782 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:55,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:55,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:55,784 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:55,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:55,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:55,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:55,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:55,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:55,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:55,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:39:55,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:55,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:55,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:39:55,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:55,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:55,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:55,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:55,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:39:55,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:55,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:55,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:39:55,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:39:55,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:39:55,904 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,921 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,934 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,944 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,953 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:55,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:55,971 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 17:39:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:55,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-18 17:39:55,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:56,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:56,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-18 17:39:56,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:56,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:56,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:56,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:56,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:56,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:56,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:39:56,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:39:56,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:39:56,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-18 17:39:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:56,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-18 17:39:56,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:56,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:39:56,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:39:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:56,186 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-18 17:39:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:59,352 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-18 17:39:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:59,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 17:39:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:59,361 INFO L225 Difference]: With dead ends: 1213 [2019-01-18 17:39:59,361 INFO L226 Difference]: Without dead ends: 1212 [2019-01-18 17:39:59,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-18 17:40:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-18 17:40:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-18 17:40:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-18 17:40:02,150 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-18 17:40:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:02,150 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-18 17:40:02,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:40:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-18 17:40:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:40:02,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:02,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:40:02,153 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-18 17:40:02,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:02,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:02,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:02,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:02,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:02,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:40:02,328 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-18 17:40:02,328 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:02,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:02,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:02,331 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:40:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:02,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:02,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:02,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:02,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:02,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:02,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:40:02,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:40:02,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:40:02,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:40:02,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:40:02,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:40:02,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:40:02,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:40:02,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:40:02,631 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,648 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,663 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,678 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:02,708 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:40:02,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:40:02,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:02,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:40:02,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,835 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:02,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-18 17:40:02,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:02,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-18 17:40:02,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-18 17:40:02,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:02,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:02,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-18 17:40:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:02,966 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:02,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 17:40:02,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:03,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:03,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:40:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:03,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:03,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:03,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:40:03,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:03,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:40:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:40:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:40:03,100 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-18 17:40:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:07,378 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-18 17:40:07,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:40:07,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:40:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:07,393 INFO L225 Difference]: With dead ends: 1577 [2019-01-18 17:40:07,393 INFO L226 Difference]: Without dead ends: 1575 [2019-01-18 17:40:07,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:40:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-18 17:40:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-18 17:40:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-18 17:40:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-18 17:40:09,382 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-18 17:40:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:09,382 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-18 17:40:09,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:40:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-18 17:40:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:40:09,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:09,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:40:09,383 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:09,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-18 17:40:09,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:09,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:09,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:09,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:09,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:09,542 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 17:40:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:40:09,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:09,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:09,596 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:40:09,596 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-18 17:40:09,597 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:09,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:09,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:09,598 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:40:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:09,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:09,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:09,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:09,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:09,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:09,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:09,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:40:09,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:40:09,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:40:09,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:40:09,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:40:09,650 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,668 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:40:09,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:40:09,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:40:09,781 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,799 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:09,819 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 17:40:09,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:40:09,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:09,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:40:09,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,902 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:09,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-18 17:40:09,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:09,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-18 17:40:09,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-18 17:40:09,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:09,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:09,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 17:40:09,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:09,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:09,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-18 17:40:09,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:10,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:10,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 17:40:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:10,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 17:40:10,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:10,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:40:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:40:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:40:10,104 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-18 17:40:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:13,376 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-18 17:40:13,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:40:13,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:40:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:13,383 INFO L225 Difference]: With dead ends: 1108 [2019-01-18 17:40:13,384 INFO L226 Difference]: Without dead ends: 1107 [2019-01-18 17:40:13,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:40:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-18 17:40:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-18 17:40:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-18 17:40:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-18 17:40:16,124 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-18 17:40:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:16,124 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-18 17:40:16,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:40:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-18 17:40:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:40:16,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:16,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:40:16,127 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-18 17:40:16,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:16,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:40:16,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:16,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:16,222 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:40:16,223 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-18 17:40:16,224 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:16,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:16,226 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:16,226 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:40:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:16,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:16,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:16,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:16,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:16,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:16,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:16,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:40:16,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:40:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:40:16,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:40:16,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:40:16,273 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:40:16,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:40:16,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:40:16,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:40:16,454 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,469 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,483 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,499 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:16,527 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:40:16,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:40:16,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:16,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:16,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:40:16,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:16,609 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:16,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:40:16,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:40:16,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:40:16,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 17:40:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:16,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:16,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:16,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:40:16,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:16,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:40:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:40:16,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:40:16,788 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-18 17:40:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:19,754 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-18 17:40:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:40:19,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:40:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:19,760 INFO L225 Difference]: With dead ends: 1075 [2019-01-18 17:40:19,760 INFO L226 Difference]: Without dead ends: 1074 [2019-01-18 17:40:19,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:40:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-18 17:40:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-18 17:40:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-18 17:40:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-18 17:40:22,522 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-18 17:40:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:22,522 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-18 17:40:22,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:40:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-18 17:40:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:40:22,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:22,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:40:22,524 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-18 17:40:22,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:22,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:22,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:22,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:40:22,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:22,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:22,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:40:22,631 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-18 17:40:22,631 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:22,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:22,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:22,633 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:40:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:22,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:22,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:22,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:22,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:22,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:22,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:22,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:40:22,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:40:22,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:40:22,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:40:22,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:40:22,699 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,729 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:40:22,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:40:22,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:40:22,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:22,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:40:22,916 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,933 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,949 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,966 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:22,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:22,997 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:40:23,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:40:23,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:23,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:23,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:40:23,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,235 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:23,236 INFO L303 Elim1Store]: Index analysis took 153 ms [2019-01-18 17:40:23,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:40:23,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:23,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:23,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-18 17:40:23,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:40:23,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:23,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:23,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-18 17:40:23,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:23,509 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:23,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 17:40:23,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:23,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:23,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-18 17:40:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:23,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:23,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:23,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:40:23,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:23,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:40:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:40:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:40:23,639 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-18 17:40:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:28,137 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-18 17:40:28,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:40:28,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:40:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:28,144 INFO L225 Difference]: With dead ends: 1522 [2019-01-18 17:40:28,144 INFO L226 Difference]: Without dead ends: 1521 [2019-01-18 17:40:28,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:40:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-18 17:40:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-18 17:40:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-18 17:40:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-18 17:40:31,146 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-18 17:40:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:31,147 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-18 17:40:31,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:40:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-18 17:40:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:40:31,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:31,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:40:31,149 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-18 17:40:31,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:31,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:31,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:31,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:31,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:31,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:40:31,186 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-18 17:40:31,187 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:31,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:31,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:31,190 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:40:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:31,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:31,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:31,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:31,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:31,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:31,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:40:31,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:40:31,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:40:31,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 17:40:31,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-18 17:40:31,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:31,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:31,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:31,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:31,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:31,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:31,293 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-18 17:40:31,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:31,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-18 17:40:31,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:31,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:31,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-18 17:40:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:31,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:31,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:40:31,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:40:31,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:40:31,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:40:31,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:40:31,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:40:31,340 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-18 17:40:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:35,261 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-18 17:40:35,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:40:35,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-18 17:40:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:35,268 INFO L225 Difference]: With dead ends: 1559 [2019-01-18 17:40:35,269 INFO L226 Difference]: Without dead ends: 1554 [2019-01-18 17:40:35,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:40:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-18 17:40:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-18 17:40:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-18 17:40:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-18 17:40:39,475 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-18 17:40:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:39,476 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-18 17:40:39,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:40:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-18 17:40:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:40:39,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:39,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:40:39,478 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:39,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:39,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-18 17:40:39,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:39,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:39,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:40:39,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:39,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:39,535 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:40:39,535 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-18 17:40:39,536 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:39,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:39,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:39,539 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:40:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:39,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:39,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:39,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:39,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:39,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:39,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:40:39,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 21 treesize of output 23 [2019-01-18 17:40:39,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:40:39,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:40:39,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:40:39,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:40:39,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:40:39,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:40:39,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:40:39,852 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,872 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,903 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:39,932 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:40:39,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:39,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:40:39,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:39,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:39,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:40:40,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:40,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:40,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:40,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:40,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:40,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:40,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:40,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:40:40,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:40:40,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:40:40,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 17:40:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:40,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:40,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:40,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:40:40,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:40,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:40:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:40:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:40:40,196 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-18 17:40:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:44,446 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-18 17:40:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:40:44,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:40:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:44,454 INFO L225 Difference]: With dead ends: 1574 [2019-01-18 17:40:44,454 INFO L226 Difference]: Without dead ends: 1570 [2019-01-18 17:40:44,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:40:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-18 17:40:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-18 17:40:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-18 17:40:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-18 17:40:48,705 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-18 17:40:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:48,705 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-18 17:40:48,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:40:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-18 17:40:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:40:48,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:48,707 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 17:40:48,707 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-18 17:40:48,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:48,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:40:48,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:48,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:48,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:40:48,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:40:48,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:48,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:40:48,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:40:48,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:40:48,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:40:48,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:48,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:40:48,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:40:48,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:40:48,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:40:48,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:48,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:40:48,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:48,932 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:48,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:48,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:48,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:48,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:40:48,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:40:49,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:40:49,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:40:49,082 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:49,096 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:49,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:49,125 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:49,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:49,153 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:40:49,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:40:49,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:49,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-01-18 17:40:49,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 17:40:49,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:40:49,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:40:49,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:40:49,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-18 17:40:49,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,397 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:49,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 17:40:49,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:49,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:49,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-18 17:40:49,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:49,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-18 17:40:49,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:49,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:49,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-18 17:40:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:49,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:49,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:49,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:40:49,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:49,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:40:49,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:40:49,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:40:49,574 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-18 17:40:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:55,473 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-18 17:40:55,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:40:55,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:40:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:55,478 INFO L225 Difference]: With dead ends: 2098 [2019-01-18 17:40:55,478 INFO L226 Difference]: Without dead ends: 2091 [2019-01-18 17:40:55,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:40:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-18 17:41:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-18 17:41:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-18 17:41:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-18 17:41:00,507 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-18 17:41:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:41:00,507 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-18 17:41:00,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:41:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-18 17:41:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:41:00,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:41:00,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:41:00,509 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:41:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-18 17:41:00,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:41:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:00,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:41:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:00,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:41:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:00,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:00,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:41:00,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:41:00,699 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-18 17:41:00,700 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:41:00,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:41:00,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:41:00,702 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:41:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:00,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:41:00,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:00,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:41:00,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:41:00,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:41:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:00,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:41:00,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:41:00,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 21 treesize of output 23 [2019-01-18 17:41:00,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:41:00,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:41:00,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:41:00,762 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:41:00,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:41:00,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:41:00,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:00,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:41:00,934 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,962 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:00,977 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:01,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:01,004 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:41:01,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:01,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:41:01,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:01,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:01,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 17:41:01,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:01,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:01,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:01,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:01,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:01,086 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:41:01,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 17:41:01,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:01,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:01,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-18 17:41:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:01,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:41:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:01,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:41:01,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:41:01,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:41:01,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:41:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:41:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:41:01,213 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-18 17:41:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:41:06,190 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-18 17:41:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:41:06,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:41:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:41:06,194 INFO L225 Difference]: With dead ends: 1846 [2019-01-18 17:41:06,195 INFO L226 Difference]: Without dead ends: 1839 [2019-01-18 17:41:06,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:41:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-18 17:41:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-18 17:41:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-18 17:41:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-18 17:41:11,251 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-18 17:41:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:41:11,251 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-18 17:41:11,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:41:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-18 17:41:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:41:11,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:41:11,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:41:11,254 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:41:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-18 17:41:11,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:41:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:41:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:11,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:41:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:41:11,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:11,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:41:11,418 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:41:11,419 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-18 17:41:11,419 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:41:11,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:41:11,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:41:11,421 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:41:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:11,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:41:11,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:11,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:41:11,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:41:11,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:41:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:11,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:41:11,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:41:11,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:41:11,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:41:11,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:41:11,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:41:11,464 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,489 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:41:11,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:41:11,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:41:11,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:41:11,636 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,650 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,663 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,678 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:11,705 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:41:11,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:41:11,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:41:11,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:41:11,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-18 17:41:11,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-01-18 17:41:11,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:11,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:11,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-01-18 17:41:12,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:12,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:41:12,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-18 17:41:12,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,099 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:41:12,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-18 17:41:12,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:12,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,159 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:41:12,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:12,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-18 17:41:12,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:12,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:41:12,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-18 17:41:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:12,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:41:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:12,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:41:12,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 17:41:12,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:41:12,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:41:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:41:12,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:41:12,356 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-18 17:41:12,555 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-18 17:41:14,292 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-18 17:41:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:41:19,301 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-18 17:41:19,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:41:19,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:41:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:41:19,307 INFO L225 Difference]: With dead ends: 2193 [2019-01-18 17:41:19,307 INFO L226 Difference]: Without dead ends: 2192 [2019-01-18 17:41:19,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:41:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-18 17:41:24,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-18 17:41:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-18 17:41:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-18 17:41:24,756 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-18 17:41:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:41:24,756 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-18 17:41:24,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:41:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-18 17:41:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:41:24,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:41:24,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:41:24,759 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:41:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-18 17:41:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:41:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:24,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:41:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:24,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:41:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:24,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:41:24,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:41:24,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:41:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:24,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:41:24,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:41:24,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:41:24,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:41:24,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:41:24,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:41:24,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:24,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:41:24,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:24,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:24,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:41:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:41:25,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:41:25,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:41:25,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:41:25,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:41:25,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:41:25,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:41:25,196 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,279 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,292 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,302 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,310 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:25,338 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:41:25,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:41:25,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:25,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:41:25,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:41:25,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:25,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-18 17:41:25,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,494 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:41:25,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 17:41:25,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:25,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-18 17:41:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:25,562 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:41:25,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 17:41:25,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:25,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:25,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-18 17:41:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:25,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:41:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:25,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:41:25,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:41:25,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:41:25,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:41:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:41:25,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:41:25,684 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-18 17:41:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:41:32,849 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-18 17:41:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:41:32,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:41:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:41:32,855 INFO L225 Difference]: With dead ends: 2526 [2019-01-18 17:41:32,855 INFO L226 Difference]: Without dead ends: 2520 [2019-01-18 17:41:32,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:41:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-18 17:41:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-18 17:41:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-18 17:41:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-18 17:41:38,434 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-18 17:41:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:41:38,434 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-18 17:41:38,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:41:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-18 17:41:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:41:38,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:41:38,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:41:38,438 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:41:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-18 17:41:38,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:41:38,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:38,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:41:38,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:38,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:41:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:38,614 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-18 17:41:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:41:38,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:38,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:41:38,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:41:38,742 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-18 17:41:38,743 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:41:38,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:41:38,746 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:41:38,746 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:41:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:38,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:41:38,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:38,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:41:38,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:41:38,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:41:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:38,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:41:38,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:41:38,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:41:38,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:41:38,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:41:38,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:41:38,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:38,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:38,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:38,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:38,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:38,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:41:38,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:38,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:41:39,030 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-18 17:41:39,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:41:39,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:41:39,082 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:39,096 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:39,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:39,125 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:39,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:39,152 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:41:39,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:41:39,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:41:39,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:41:39,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-18 17:41:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:39,341 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:41:39,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 59 [2019-01-18 17:41:39,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:39,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:39,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-18 17:41:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:39,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:41:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:39,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:41:39,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-18 17:41:39,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:41:39,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:41:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:41:39,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:41:39,469 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-18 17:41:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:41:44,958 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-18 17:41:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:41:44,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 17:41:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:41:44,963 INFO L225 Difference]: With dead ends: 1971 [2019-01-18 17:41:44,964 INFO L226 Difference]: Without dead ends: 1964 [2019-01-18 17:41:44,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:41:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-18 17:41:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-18 17:41:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-18 17:41:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-18 17:41:50,491 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-18 17:41:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:41:50,491 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-18 17:41:50,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:41:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-18 17:41:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:41:50,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:41:50,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:41:50,495 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:41:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:41:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-18 17:41:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:41:50,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:50,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:41:50,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:41:50,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:41:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:41:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:41:50,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:50,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:41:50,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:41:50,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:41:50,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:41:50,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:41:50,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:41:50,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:41:50,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:41:50,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:41:50,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:41:50,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:41:50,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:41:50,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:41:50,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:41:50,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:41:50,680 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:41:50,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:41:50,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:41:50,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:41:50,863 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,876 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,907 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:50,935 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:41:50,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:50,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:41:50,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:50,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:50,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:41:51,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:41:51,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:51,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:51,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 17:41:51,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:41:51,080 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:41:51,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-18 17:41:51,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:41:51,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:41:51,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 17:41:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:51,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:41:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:41:51,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:41:51,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:41:51,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:41:51,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:41:51,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:41:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:41:51,186 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-18 17:41:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:41:56,997 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-18 17:41:56,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:41:56,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 17:41:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:41:57,004 INFO L225 Difference]: With dead ends: 2036 [2019-01-18 17:41:57,004 INFO L226 Difference]: Without dead ends: 2033 [2019-01-18 17:41:57,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:41:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-18 17:42:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-18 17:42:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-18 17:42:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-18 17:42:03,318 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-18 17:42:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:42:03,319 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-18 17:42:03,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:42:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-18 17:42:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:42:03,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:42:03,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:42:03,322 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:42:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:42:03,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-18 17:42:03,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:42:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:03,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:42:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:03,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:42:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:42:03,484 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-18 17:42:03,648 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-18 17:42:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:42:03,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:03,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:42:03,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:42:03,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:42:03,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:03,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:42:03,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:42:03,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:42:03,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:42:03,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:42:03,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:42:03,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:03,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 17:42:03,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:03,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:03,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:42:03,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:03,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:03,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:03,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:03,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 17:42:03,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:03,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:03,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:03,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:42:03,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:42:03,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:42:03,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:42:03,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:42:03,944 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:03,963 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:03,975 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:03,987 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:03,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:04,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:42:04,019 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 17:42:04,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-18 17:42:04,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:42:04,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 17:42:04,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-18 17:42:04,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 17:42:04,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-18 17:42:04,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:04,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 45 treesize of output 59 [2019-01-18 17:42:04,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:04,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-18 17:42:04,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-18 17:42:04,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-01-18 17:42:04,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:04,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 17:42:04,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:04,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,778 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:04,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 17:42:04,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:04,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:04,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:04,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-01-18 17:42:04,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:04,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-18 17:42:04,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-18 17:42:05,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,008 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:05,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-01-18 17:42:05,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:05,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 17:42:05,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:05,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,178 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:05,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-18 17:42:05,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:05,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:05,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-01-18 17:42:05,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:05,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-18 17:42:05,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-18 17:42:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:05,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:42:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:05,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:42:05,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:42:05,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:42:05,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:42:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:42:05,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:42:05,568 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-18 17:42:07,587 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-18 17:42:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:42:14,627 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-18 17:42:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:42:14,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:42:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:42:14,634 INFO L225 Difference]: With dead ends: 2952 [2019-01-18 17:42:14,634 INFO L226 Difference]: Without dead ends: 2951 [2019-01-18 17:42:14,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:42:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-18 17:42:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-18 17:42:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-18 17:42:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-18 17:42:19,708 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-18 17:42:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:42:19,708 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-18 17:42:19,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:42:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-18 17:42:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:42:19,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:42:19,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:42:19,712 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:42:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:42:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-18 17:42:19,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:42:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:19,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:42:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:19,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:42:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:42:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:42:19,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:19,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:42:19,868 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:42:19,868 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-18 17:42:19,869 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:42:19,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:42:19,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:42:19,871 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:42:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:42:19,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:42:19,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:19,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:42:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:42:19,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:42:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:42:19,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:42:19,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:42:19,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:42:19,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:42:19,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:19,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:42:19,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:42:20,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:42:20,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:42:20,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:42:20,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:42:20,062 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,082 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,093 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,102 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:42:20,138 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:42:20,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:42:20,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:42:20,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:42:20,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-18 17:42:20,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,330 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:20,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-01-18 17:42:20,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:20,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-18 17:42:20,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:20,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:42:20,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-18 17:42:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:20,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:42:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:20,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:42:20,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-18 17:42:20,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:42:20,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:42:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:42:20,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:42:20,557 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-18 17:42:21,014 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-18 17:42:22,618 WARN L181 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-18 17:42:22,867 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-18 17:42:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:42:28,463 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-18 17:42:28,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:42:28,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:42:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:42:28,468 INFO L225 Difference]: With dead ends: 1903 [2019-01-18 17:42:28,468 INFO L226 Difference]: Without dead ends: 1896 [2019-01-18 17:42:28,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:42:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-18 17:42:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-18 17:42:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-18 17:42:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-18 17:42:34,059 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-18 17:42:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:42:34,059 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-18 17:42:34,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:42:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-18 17:42:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:42:34,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:42:34,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:42:34,062 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:42:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:42:34,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-18 17:42:34,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:42:34,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:34,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:42:34,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:34,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:42:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:42:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:42:34,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:34,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:42:34,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:42:34,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:42:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:34,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:42:34,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:42:34,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:42:34,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:42:34,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:42:34,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:42:34,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:42:34,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:42:34,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:42:34,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:42:34,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:42:34,198 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:42:34,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:42:34,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:42:34,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:42:34,366 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,380 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,394 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,409 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:42:34,435 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:42:34,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:42:34,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:34,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:42:34,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:42:34,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:34,511 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:34,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:42:34,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:42:34,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:42:34,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-01-18 17:42:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:34,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:42:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:34,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:42:34,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:42:34,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:42:34,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:42:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:42:34,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:42:34,691 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-18 17:42:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:42:40,240 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-18 17:42:40,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:42:40,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:42:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:42:40,245 INFO L225 Difference]: With dead ends: 1884 [2019-01-18 17:42:40,245 INFO L226 Difference]: Without dead ends: 1877 [2019-01-18 17:42:40,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:42:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-18 17:42:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-18 17:42:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-18 17:42:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-18 17:42:45,978 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-18 17:42:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:42:45,978 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-18 17:42:45,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:42:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-18 17:42:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:42:45,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:42:45,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:42:45,981 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:42:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:42:45,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-18 17:42:45,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:42:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:45,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:42:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:42:45,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:42:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:42:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:46,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:46,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:42:46,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:42:46,120 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-18 17:42:46,121 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:42:46,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:42:46,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:42:46,123 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:42:46,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:42:46,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:42:46,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:42:46,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:42:46,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:42:46,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:42:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:42:46,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:42:46,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:42:46,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:42:46,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:42:46,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:42:46,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:42:46,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:42:46,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:42:46,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:42:46,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:42:46,370 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,390 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,411 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,421 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:42:46,595 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:42:46,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 17:42:46,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:42:46,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 17:42:46,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-18 17:42:46,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:42:46,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:42:46,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-18 17:42:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:42:46,730 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:42:46,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 17:42:46,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:42:46,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:42:46,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-18 17:42:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:46,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:42:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:42:46,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:42:46,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 17:42:46,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:42:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:42:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:42:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:42:46,927 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-18 17:42:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:42:55,715 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-18 17:42:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:42:55,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:42:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:42:55,722 INFO L225 Difference]: With dead ends: 2991 [2019-01-18 17:42:55,722 INFO L226 Difference]: Without dead ends: 2978 [2019-01-18 17:42:55,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:42:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-18 17:43:03,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-18 17:43:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-18 17:43:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-18 17:43:03,099 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-18 17:43:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:43:03,099 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-18 17:43:03,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:43:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-18 17:43:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:43:03,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:43:03,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:43:03,103 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:43:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:03,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-18 17:43:03,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:43:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:03,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:03,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:43:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:43:03,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:03,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:43:03,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:43:03,217 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-18 17:43:03,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:43:03,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:43:03,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:43:03,221 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 17:43:03,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:03,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:43:03,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:03,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:43:03,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:03,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:43:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:03,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:43:03,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:43:03,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:43:03,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:43:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:43:03,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:43:03,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:43:03,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:43:03,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:43:03,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:43:03,459 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,482 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,495 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,505 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,515 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,543 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-18 17:43:03,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:43:03,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:03,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-18 17:43:03,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 17:43:03,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:03,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 17:43:03,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,704 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:03,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 17:43:03,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,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-01-18 17:43:03,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-18 17:43:03,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,772 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:03,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-18 17:43:03,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:03,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-18 17:43:03,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:03,842 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:03,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 17:43:03,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:03,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:03,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-18 17:43:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:03,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:43:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:43:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:43:04,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:43:04,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:43:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:43:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:43:04,128 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-18 17:43:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:43:14,108 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-18 17:43:14,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:43:14,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-18 17:43:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:43:14,116 INFO L225 Difference]: With dead ends: 3181 [2019-01-18 17:43:14,116 INFO L226 Difference]: Without dead ends: 3179 [2019-01-18 17:43:14,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:43:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-18 17:43:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-18 17:43:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-18 17:43:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-18 17:43:21,484 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-18 17:43:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:43:21,484 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-18 17:43:21,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:43:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-18 17:43:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:43:21,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:43:21,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:43:21,488 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:43:21,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:21,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-18 17:43:21,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:43:21,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:21,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:21,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:21,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:43:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:43:21,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:43:21,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:43:21,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:43:21,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:43:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:43:21,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:43:21,623 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-18 17:43:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:43:28,685 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-18 17:43:28,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:43:28,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-18 17:43:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:43:28,691 INFO L225 Difference]: With dead ends: 2346 [2019-01-18 17:43:28,691 INFO L226 Difference]: Without dead ends: 2337 [2019-01-18 17:43:28,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:43:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-18 17:43:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-18 17:43:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-18 17:43:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-18 17:43:35,922 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-18 17:43:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:43:35,922 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-18 17:43:35,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:43:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-18 17:43:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:43:35,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:43:35,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:43:35,926 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:43:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-18 17:43:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:43:35,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:35,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:35,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:43:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:43:36,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:36,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:43:36,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:43:36,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:43:36,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:36,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:43:36,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:43:36,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:43:36,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:43:36,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:43:36,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:43:36,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:43:36,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:43:36,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:43:36,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:43:36,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:43:36,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:43:36,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:43:36,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:43:36,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:43:36,286 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,308 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,331 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,341 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,369 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-18 17:43:36,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:43:36,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:36,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-18 17:43:36,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 17:43:36,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:36,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 17:43:36,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,764 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:36,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,773 INFO L303 Elim1Store]: Index analysis took 253 ms [2019-01-18 17:43:36,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-18 17:43:36,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:36,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-18 17:43:36,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,843 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:36,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 17:43:36,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:36,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:43:36,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:36,913 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:36,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 17:43:36,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:36,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:36,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-18 17:43:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:36,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:43:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:37,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:43:37,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:43:37,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:43:37,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:43:37,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:43:37,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:43:37,080 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-18 17:43:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:43:44,906 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-18 17:43:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:43:44,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-18 17:43:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:43:44,912 INFO L225 Difference]: With dead ends: 2345 [2019-01-18 17:43:44,913 INFO L226 Difference]: Without dead ends: 2338 [2019-01-18 17:43:44,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:43:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-18 17:43:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-18 17:43:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-18 17:43:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-18 17:43:47,025 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-18 17:43:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:43:47,025 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-18 17:43:47,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:43:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-18 17:43:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:43:47,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:43:47,026 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-18 17:43:47,026 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:43:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-18 17:43:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:43:47,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:47,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:43:47,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:47,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:43:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:43:47,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:47,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:43:47,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:43:47,074 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-18 17:43:47,075 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:43:47,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:43:47,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:43:47,077 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:43:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:47,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:43:47,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:47,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:43:47,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:47,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:43:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:47,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:43:47,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:43:47,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:43:47,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:43:47,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:43:47,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:43:47,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:43:47,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:43:47,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,327 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-18 17:43:47,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:43:47,327 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,335 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,343 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:47,362 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 17:43:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:43:47,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-18 17:43:47,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 17:43:47,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-18 17:43:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-18 17:43:47,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:47,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-18 17:43:47,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:47,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-18 17:43:47,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:47,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:47,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-18 17:43:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:47,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:43:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:47,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:43:47,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 17:43:47,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:43:47,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:43:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:43:47,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:43:47,581 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-18 17:43:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:43:49,792 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-18 17:43:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:43:49,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:43:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:43:49,793 INFO L225 Difference]: With dead ends: 480 [2019-01-18 17:43:49,793 INFO L226 Difference]: Without dead ends: 477 [2019-01-18 17:43:49,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:43:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-18 17:43:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-18 17:43:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-18 17:43:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-18 17:43:50,687 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-18 17:43:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:43:50,687 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-18 17:43:50,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:43:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-18 17:43:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:43:50,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:43:50,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:43:50,688 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:43:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-18 17:43:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:43:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:50,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:50,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:43:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:43:50,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:50,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:43:50,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:43:50,731 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 17:43:50,731 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:43:50,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:43:50,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:43:50,733 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:43:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:50,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:43:50,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:50,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:43:50,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:50,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:43:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:50,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:43:50,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:43:50,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:43:50,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:43:50,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:43:50,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:43:50,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:43:50,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:43:50,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:43:50,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:50,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:43:50,956 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,971 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,984 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:50,999 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:51,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:51,025 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:43:51,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:43:51,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:51,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:51,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:43:51,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:43:51,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:51,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:51,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 17:43:51,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:51,150 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:51,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-18 17:43:51,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:51,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:51,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 17:43:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:51,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:43:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:43:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:43:51,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:43:51,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:43:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:43:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:43:51,238 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-18 17:43:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:43:53,023 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-18 17:43:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:43:53,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:43:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:43:53,024 INFO L225 Difference]: With dead ends: 250 [2019-01-18 17:43:53,024 INFO L226 Difference]: Without dead ends: 243 [2019-01-18 17:43:53,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:43:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-18 17:43:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-18 17:43:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-18 17:43:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-18 17:43:54,455 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-18 17:43:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:43:54,455 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-18 17:43:54,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:43:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-18 17:43:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:43:54,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:43:54,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:43:54,456 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:43:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:54,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-18 17:43:54,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:43:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:54,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:54,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:43:54,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:43:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:43:54,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:54,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:43:54,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:43:54,533 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-18 17:43:54,534 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:43:54,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:43:54,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:43:54,536 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:43:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:43:54,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:43:54,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:43:54,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:43:54,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:43:54,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:43:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:43:54,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:43:54,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:43:54,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:43:54,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:43:54,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:43:54,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 17:43:54,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 17:43:54,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 17:43:54,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:43:54,683 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,691 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,699 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:54,717 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 17:43:54,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:43:54,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-18 17:43:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 17:43:54,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:54,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-18 17:43:54,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:43:54,808 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:43:54,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-18 17:43:54,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:43:54,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:43:54,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-18 17:43:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:54,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:43:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:43:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:43:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:43:54,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:43:54,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:43:54,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:43:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:43:54,886 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-18 17:43:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:43:57,975 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-18 17:43:57,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:43:57,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:43:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:43:57,977 INFO L225 Difference]: With dead ends: 372 [2019-01-18 17:43:57,977 INFO L226 Difference]: Without dead ends: 362 [2019-01-18 17:43:57,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:43:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-18 17:44:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-18 17:44:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-18 17:44:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-18 17:44:00,151 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-18 17:44:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:00,151 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-18 17:44:00,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:44:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-18 17:44:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:44:00,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:00,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:00,153 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-18 17:44:00,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:00,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:00,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:00,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:00,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:44:00,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:44:00,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:44:00,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:00,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:44:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:44:00,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:44:00,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:44:00,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:44:00,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:44:00,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:44:00,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:44:00,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:44:00,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:44:00,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:44:00,274 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,299 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:44:00,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:44:00,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:44:00,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:44:00,443 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,457 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,470 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,485 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:00,511 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:44:00,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:44:00,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:00,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:44:00,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,584 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:00,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:44:00,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:44:00,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:00,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 17:44:00,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:00,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 17:44:00,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:00,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:00,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-18 17:44:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:00,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:44:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:44:00,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:44:00,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:44:00,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:44:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:44:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:44:00,825 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-18 17:44:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:44:03,609 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-18 17:44:03,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:44:03,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:44:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:44:03,611 INFO L225 Difference]: With dead ends: 332 [2019-01-18 17:44:03,611 INFO L226 Difference]: Without dead ends: 325 [2019-01-18 17:44:03,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:44:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-18 17:44:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-18 17:44:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-18 17:44:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-18 17:44:05,897 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-18 17:44:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:05,898 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-18 17:44:05,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:44:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-18 17:44:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:44:05,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:05,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:05,899 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-18 17:44:05,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:05,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:44:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:05,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:44:05,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:05,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:44:05,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:44:05,961 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-18 17:44:05,962 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:44:05,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:44:05,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:44:05,964 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:44:05,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:05,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:44:05,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:05,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:44:05,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:05,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:44:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:05,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:44:05,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:44:05,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:05,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:05,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:44:06,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:44:06,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:44:06,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:44:06,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:44:06,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:44:06,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:44:06,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:44:06,150 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,172 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,183 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,192 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:06,228 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:44:06,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:44:06,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:06,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:44:06,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,318 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:06,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 17:44:06,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:06,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 17:44:06,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:06,363 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:06,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 17:44:06,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:06,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:06,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 17:44:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:06,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:44:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:06,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:44:06,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:44:06,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:44:06,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:44:06,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:44:06,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:44:06,462 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-18 17:44:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:44:08,986 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-18 17:44:08,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:44:08,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:44:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:44:08,988 INFO L225 Difference]: With dead ends: 294 [2019-01-18 17:44:08,988 INFO L226 Difference]: Without dead ends: 287 [2019-01-18 17:44:08,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:44:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-18 17:44:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-18 17:44:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-18 17:44:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-18 17:44:11,289 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-18 17:44:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:11,289 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-18 17:44:11,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:44:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-18 17:44:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:44:11,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:11,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:11,290 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-18 17:44:11,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:11,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:11,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:44:11,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:11,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:44:11,435 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:44:11,435 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-18 17:44:11,436 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:44:11,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:44:11,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:44:11,439 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:44:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:11,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:44:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:11,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:44:11,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:11,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:44:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:11,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:44:11,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:44:11,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:44:11,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:44:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:44:11,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:44:11,483 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,508 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:44:11,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:44:11,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:44:11,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:44:11,654 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,668 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,681 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,696 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:11,722 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:44:11,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:44:11,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:11,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:11,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 17:44:11,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:44:11,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:44:11,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:11,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-18 17:44:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,989 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:11,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:11,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-01-18 17:44:11,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:12,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:12,049 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:12,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-18 17:44:12,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:12,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:12,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-18 17:44:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:12,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:44:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:12,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:44:12,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 17:44:12,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:44:12,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:44:12,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:44:12,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:44:12,231 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-18 17:44:12,520 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-18 17:44:12,763 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-18 17:44:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:44:15,733 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-18 17:44:15,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:44:15,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:44:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:44:15,735 INFO L225 Difference]: With dead ends: 364 [2019-01-18 17:44:15,735 INFO L226 Difference]: Without dead ends: 357 [2019-01-18 17:44:15,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:44:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-18 17:44:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-18 17:44:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-18 17:44:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-18 17:44:18,147 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-18 17:44:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-18 17:44:18,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:44:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-18 17:44:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:44:18,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:18,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:18,148 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-18 17:44:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:18,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:18,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:18,544 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-01-18 17:44:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:44:18,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:18,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:44:18,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:44:18,582 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-18 17:44:18,583 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:44:18,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:44:18,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:44:18,584 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:44:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:18,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:44:18,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:18,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:44:18,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:18,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:44:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:18,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:44:18,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:44:18,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:44:18,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:44:18,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44: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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:44:18,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:44:18,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,648 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:44:18,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:44:18,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:44:18,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:44:18,793 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,807 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,820 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:18,861 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:44:18,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:44:18,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:18,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:44:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 17:44:18,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:18,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:18,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-18 17:44:18,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:18,995 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:18,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 17:44:18,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:19,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:19,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 17:44:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:21,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:44:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:21,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:44:21,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:44:21,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:44:21,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:44:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:44:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=100, Unknown=1, NotChecked=0, Total=156 [2019-01-18 17:44:21,088 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-18 17:44:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:44:24,025 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-18 17:44:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:44:24,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:44:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:44:24,027 INFO L225 Difference]: With dead ends: 319 [2019-01-18 17:44:24,027 INFO L226 Difference]: Without dead ends: 312 [2019-01-18 17:44:24,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=85, Invalid=154, Unknown=1, NotChecked=0, Total=240 [2019-01-18 17:44:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-18 17:44:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-18 17:44:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-18 17:44:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-18 17:44:26,816 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-18 17:44:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:26,816 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-18 17:44:26,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:44:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-18 17:44:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:44:26,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:26,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:26,817 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-18 17:44:26,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:26,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:26,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:26,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:26,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:44:26,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:26,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:44:26,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:44:26,920 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-18 17:44:26,921 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:44:26,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:44:26,923 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:44:26,923 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:44:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:26,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:44:26,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:26,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:44:26,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:26,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:44:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:26,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:44:26,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:44:26,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:26,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:26,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:44:26,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:26,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:26,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:26,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:26,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:44:27,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:44:27,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,075 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:44:27,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:44:27,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:44:27,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:44:27,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:44:27,129 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,150 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,161 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,171 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,180 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:27,206 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:44:27,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:44:27,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:44:27,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:27,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-18 17:44:27,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-18 17:44:27,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-18 17:44:27,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:27,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-18 17:44:27,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,586 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:27,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-18 17:44:27,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,645 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:27,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:27,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-18 17:44:27,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:27,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:27,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-18 17:44:27,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-01-18 17:44:27,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:44:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:27,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:44:27,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 17:44:27,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:44:27,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:44:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:44:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:44:27,788 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-18 17:44:28,004 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-18 17:44:29,103 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-18 17:44:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:44:32,025 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-18 17:44:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:44:32,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:44:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:44:32,027 INFO L225 Difference]: With dead ends: 392 [2019-01-18 17:44:32,027 INFO L226 Difference]: Without dead ends: 386 [2019-01-18 17:44:32,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:44:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-18 17:44:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-18 17:44:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-18 17:44:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-18 17:44:34,995 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-18 17:44:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:34,996 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-18 17:44:34,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:44:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-18 17:44:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:44:34,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:34,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:34,997 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-18 17:44:34,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:34,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:34,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:34,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:34,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:44:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:44:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:44:35,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:44:35,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:44:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:44:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:44:35,062 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-18 17:44:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:44:37,930 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-18 17:44:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:44:37,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-18 17:44:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:44:37,932 INFO L225 Difference]: With dead ends: 320 [2019-01-18 17:44:37,932 INFO L226 Difference]: Without dead ends: 315 [2019-01-18 17:44:37,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:44:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-18 17:44:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-18 17:44:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-18 17:44:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-18 17:44:40,909 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-18 17:44:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:40,909 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-18 17:44:40,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:44:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-18 17:44:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:44:40,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:40,910 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:40,910 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:40,910 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-18 17:44:40,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:40,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:40,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:44:40,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:40,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:44:40,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:44:40,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:44:40,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:40,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:44:40,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:44:40,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:44:40,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:44:40,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:44:40,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:44:40,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:44:41,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:44:41,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:44:41,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:44:41,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:44:41,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:44:41,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:44:41,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:44:41,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:44:41,165 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,186 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,198 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:41,242 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:44:41,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 17:44:41,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:41,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 17:44:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-18 17:44:41,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:41,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-18 17:44:41,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 17:44:41,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:44:41,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:41,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-18 17:44:41,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:41,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:41,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-18 17:44:41,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:41,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:41,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 17:44:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:41,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:44:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:41,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:44:41,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:44:41,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:44:41,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:44:41,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:44:41,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:44:41,663 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-18 17:44:47,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:44:47,749 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-18 17:44:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:44:47,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:44:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:44:47,751 INFO L225 Difference]: With dead ends: 601 [2019-01-18 17:44:47,751 INFO L226 Difference]: Without dead ends: 591 [2019-01-18 17:44:47,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:44:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-18 17:44:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-18 17:44:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-18 17:44:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-18 17:44:52,710 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-18 17:44:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:44:52,710 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-18 17:44:52,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:44:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-18 17:44:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:44:52,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:44:52,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:44:52,711 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:44:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-18 17:44:52,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:44:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:52,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:44:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:44:52,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:44:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:44:52,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:52,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:44:52,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:44:52,816 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 17:44:52,817 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:44:52,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:44:52,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:44:52,819 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:44:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:44:52,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:44:52,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:44:52,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:44:52,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:44:52,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:44:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:44:52,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:44:52,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:44:52,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:44:52,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:44:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:52,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:44:52,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:52,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:52,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:52,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:44:53,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:44:53,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:44:53,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:44:53,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:44:53,029 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,049 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,060 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,070 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:53,105 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:44:53,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 17:44:53,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,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-01-18 17:44:53,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:44:53,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-18 17:44:53,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:44:53,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:44:53,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-18 17:44:53,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,244 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:44:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:44:53,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-01-18 17:44:53,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:44:53,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:44:53,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-18 17:44:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:53,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:44:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:44:53,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:44:53,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:44:53,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:44:53,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:44:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:44:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:44:53,478 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-18 17:45:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:45:02,861 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-18 17:45:02,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:45:02,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 17:45:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:45:02,863 INFO L225 Difference]: With dead ends: 731 [2019-01-18 17:45:02,863 INFO L226 Difference]: Without dead ends: 718 [2019-01-18 17:45:02,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:45:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-18 17:45:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-18 17:45:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-18 17:45:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-18 17:45:10,912 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-18 17:45:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:45:10,912 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-18 17:45:10,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:45:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-18 17:45:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:45:10,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:45:10,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:45:10,914 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:45:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-18 17:45:10,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:45:10,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:10,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:10,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:10,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:45:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:45:11,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:11,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:45:11,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:45:11,064 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 17:45:11,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:45:11,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:45:11,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:45:11,068 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:45:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:11,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:45:11,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:11,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:45:11,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:11,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:45:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:11,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:45:11,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:45:11,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:45:11,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:45:11,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:45:11,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:45:11,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:45:11,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:45:11,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:45:11,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:45:11,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,348 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,360 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:11,405 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:45:11,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:45:11,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-18 17:45:11,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:45:11,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:11,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-18 17:45:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,545 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:45:11,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 77 [2019-01-18 17:45:11,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:11,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-18 17:45:11,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:11,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:45:11,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-18 17:45:11,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:11,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:11,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-18 17:45:11,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-01-18 17:45:11,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:45:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:45:11,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:45:11,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:45:11,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:45:11,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:45:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:45:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:45:11,737 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-18 17:45:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:45:21,311 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-18 17:45:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:45:21,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:45:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:45:21,312 INFO L225 Difference]: With dead ends: 480 [2019-01-18 17:45:21,312 INFO L226 Difference]: Without dead ends: 473 [2019-01-18 17:45:21,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:45:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-18 17:45:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-18 17:45:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-18 17:45:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-18 17:45:24,431 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-18 17:45:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:45:24,431 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-18 17:45:24,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:45:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-18 17:45:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:45:24,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:45:24,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:45:24,432 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:45:24,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:24,433 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-18 17:45:24,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:45:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:24,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:24,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:45:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:45:24,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:24,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:45:24,532 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:45:24,532 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-18 17:45:24,533 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:45:24,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:45:24,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:45:24,536 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:45:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:24,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:45:24,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:24,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:45:24,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:24,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:45:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:24,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:45:24,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:45:24,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:45:24,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:45:24,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:45:24,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:45:24,585 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,610 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:45:24,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:45:24,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:45:24,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:45:24,754 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,768 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,782 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,797 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:24,823 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:45:24,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:45:24,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:24,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:45:24,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:45:24,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:24,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 17:45:24,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,956 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:45:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:24,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-18 17:45:24,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:24,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:24,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 17:45:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:45:24,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:45:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:45:25,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:45:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:45:25,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:45:25,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:45:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:45:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:45:25,060 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-18 17:45:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:45:30,122 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-18 17:45:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:45:30,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 17:45:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:45:30,123 INFO L225 Difference]: With dead ends: 258 [2019-01-18 17:45:30,124 INFO L226 Difference]: Without dead ends: 243 [2019-01-18 17:45:30,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:45:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-18 17:45:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-18 17:45:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-18 17:45:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-18 17:45:34,363 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-18 17:45:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:45:34,363 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-18 17:45:34,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:45:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-18 17:45:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:45:34,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:45:34,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:45:34,364 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:45:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-18 17:45:34,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:45:34,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:34,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:34,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:34,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:45:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:45:34,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:34,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:45:34,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:45:34,507 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-18 17:45:34,508 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:45:34,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:45:34,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:45:34,509 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:45:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:34,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:45:34,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:34,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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:45:34,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:34,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:45:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:34,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:45:34,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:45:34,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:45:34,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:45:34,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:45:34,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:45:34,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:45:34,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:45:34,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:45:34,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:45:34,755 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,768 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,781 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,796 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,822 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-18 17:45:34,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:45:34,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:34,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:34,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-18 17:45:34,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:34,922 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:45:34,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:45:34,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:45:35,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:45:35,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-18 17:45:35,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:45:35,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-18 17:45:35,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:35,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-01-18 17:45:35,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:35,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:45:35,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-18 17:45:35,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,235 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:45:35,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-18 17:45:35,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:35,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:35,315 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:45:35,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-18 17:45:35,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:35,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:45:35,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-18 17:45:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:45:35,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:45:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:45:35,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:45:35,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:45:35,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:45:35,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:45:35,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:45:35,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:45:35,465 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-18 17:45:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:45:41,361 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-18 17:45:41,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:45:41,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:45:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:45:41,363 INFO L225 Difference]: With dead ends: 295 [2019-01-18 17:45:41,363 INFO L226 Difference]: Without dead ends: 284 [2019-01-18 17:45:41,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:45:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-18 17:45:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-18 17:45:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-18 17:45:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-18 17:45:45,861 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-18 17:45:45,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:45:45,862 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-18 17:45:45,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:45:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-18 17:45:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:45:45,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:45:45,862 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:45:45,862 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:45:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-18 17:45:45,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:45:45,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:45,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:45,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:45:45,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:45:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:45:45,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:45,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:45:45,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:45:45,976 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-18 17:45:45,976 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:45:45,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:45:45,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:45:45,978 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:45:45,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:45:45,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:45:45,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:45:45,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:45:45,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:45:45,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:45:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:45:45,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:45:45,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:45:45,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:45:46,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:45:46,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:45:46,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:45:46,021 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:45:46,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:45:46,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:45:46,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:45:46,190 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,204 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,216 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:46,257 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 17:45:46,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 17:45:46,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:46,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:46,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 17:45:46,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:46,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:45:46,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:45:46,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:45:46,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-18 17:45:48,529 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-01-18 17:45:48,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:45:48,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 17:45:48,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:45:48,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:45:48,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-18 17:45:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:45:48,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:45:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:45:48,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:45:48,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:45:48,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:45:48,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:45:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:45:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:45:48,651 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-18 17:45:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:45:55,313 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-18 17:45:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:45:55,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 17:45:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:45:55,315 INFO L225 Difference]: With dead ends: 328 [2019-01-18 17:45:55,315 INFO L226 Difference]: Without dead ends: 315 [2019-01-18 17:45:55,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:45:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-18 17:46:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-18 17:46:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-18 17:46:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-18 17:46:01,723 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-18 17:46:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:46:01,723 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-18 17:46:01,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:46:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-18 17:46:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:46:01,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:46:01,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:46:01,724 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:46:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:46:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-18 17:46:01,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:46:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:46:01,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:46:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:46:01,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:46:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:46:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:46:01,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:46:01,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:46:01,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:46:01,832 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-18 17:46:01,833 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:46:01,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:46:01,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:46:01,834 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:46:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:46:01,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:46:01,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:46:01,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:46:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:46:01,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:46:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:46:01,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:46:01,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:46:01,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:46:01,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:46:01,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:01,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:46:01,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:46:02,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:46:02,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:46:02,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:46:02,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:46:02,078 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,101 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,124 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,134 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:02,162 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:46:02,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:46:02,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:02,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:46:02,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-18 17:46:02,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:02,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-18 17:46:02,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,318 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:46:02,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:02,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-18 17:46:02,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:02,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:02,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-18 17:46:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:46:02,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:46:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:46:02,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:46:02,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:46:02,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:46:02,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:46:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:46:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:46:02,436 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-18 17:46:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:46:11,386 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-18 17:46:11,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:46:11,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 17:46:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:46:11,388 INFO L225 Difference]: With dead ends: 326 [2019-01-18 17:46:11,388 INFO L226 Difference]: Without dead ends: 313 [2019-01-18 17:46:11,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:46:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-18 17:46:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-18 17:46:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-18 17:46:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-18 17:46:19,215 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-18 17:46:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:46:19,215 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-18 17:46:19,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:46:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-18 17:46:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:46:19,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:46:19,216 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:46:19,216 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:46:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:46:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-18 17:46:19,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:46:19,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:46:19,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:46:19,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:46:19,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:46:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:46:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 17:46:19,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:46:19,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:46:19,305 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:46:19,305 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-18 17:46:19,306 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:46:19,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:46:19,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:46:19,307 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:46:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:46:19,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:46:19,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:46:19,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:46:19,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:46:19,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:46:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:46:19,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:46:19,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:46:19,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:46:19,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:46:19,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,635 INFO L303 Elim1Store]: Index analysis took 125 ms [2019-01-18 17:46:19,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:46:19,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:19,778 INFO L303 Elim1Store]: Index analysis took 141 ms [2019-01-18 17:46:19,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:46:19,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:19,935 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:19,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:19,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:19,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:19,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 43 treesize of output 39 [2019-01-18 17:46:20,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:46:20,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:46:20,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:46:20,081 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:20,095 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:20,109 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:20,124 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:20,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:20,150 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:46:20,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:46:20,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:46:20,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:46:20,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-18 17:46:20,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,321 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:46:20,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-18 17:46:20,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:20,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:20,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-18 17:46:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-18 17:46:20,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:20,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:20,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 17:46:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:20,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-18 17:46:20,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:20,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:20,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-18 17:46:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:46:20,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:46:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:46:20,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:46:20,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 17:46:20,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:46:20,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:46:20,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:46:20,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:46:20,520 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-18 17:46:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:46:31,401 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-18 17:46:31,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:46:31,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 17:46:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:46:31,403 INFO L225 Difference]: With dead ends: 400 [2019-01-18 17:46:31,404 INFO L226 Difference]: Without dead ends: 393 [2019-01-18 17:46:31,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:46:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-18 17:46:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-18 17:46:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-18 17:46:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-18 17:46:41,209 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-18 17:46:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:46:41,209 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-18 17:46:41,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:46:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-18 17:46:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:46:41,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:46:41,210 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:46:41,210 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:46:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:46:41,211 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-18 17:46:41,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:46:41,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:46:41,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:46:41,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:46:41,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:46:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:46:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 17:46:41,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:46:41,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:46:41,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:46:41,300 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-18 17:46:41,300 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:46:41,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:46:41,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:46:41,303 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:46:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:46:41,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:46:41,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:46:41,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:46:41,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:46:41,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:46:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:46:41,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:46:41,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:46:41,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:46:41,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:46:41,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:46:41,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:46:41,363 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:46:41,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:46:41,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:46:41,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:46:41,536 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,550 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,563 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:46:41,605 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 17:46:41,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:46:41,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:46:41,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:46:41,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-18 17:46:41,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,798 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:46:41,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-01-18 17:46:41,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:46:41,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-01-18 17:46:41,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:46:41,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-18 17:46:41,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-01-18 17:46:41,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:41,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:41,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,001 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:46:42,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 43 treesize of output 65 [2019-01-18 17:46:42,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:42,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:46:42,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-18 17:46:42,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-01-18 17:46:42,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:42,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:46:42,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-18 17:46:42,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:46:42,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:46:42,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-18 17:46:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:46:42,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:46:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:46:42,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:46:42,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 17:46:42,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:46:42,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:46:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:46:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:46:42,307 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-18 17:46:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:46:54,162 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-18 17:46:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:46:54,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 17:46:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:46:54,164 INFO L225 Difference]: With dead ends: 441 [2019-01-18 17:46:54,164 INFO L226 Difference]: Without dead ends: 428 [2019-01-18 17:46:54,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:46:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-18 17:47:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-18 17:47:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-18 17:47:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-18 17:47:03,992 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-18 17:47:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:47:03,992 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-18 17:47:03,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:47:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-18 17:47:03,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:47:03,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:47:03,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:47:03,993 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:47:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:47:03,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-18 17:47:03,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:47:03,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:47:03,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:47:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:47:03,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:47:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:47:04,231 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-18 17:47:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 17:47:04,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:47:04,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:47:04,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:47:04,307 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-18 17:47:04,308 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:47:04,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:47:04,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:47:04,309 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:47:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:47:04,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:47:04,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:47:04,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:47:04,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:47:04,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:47:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:47:04,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:47:04,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:47:04,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:47:04,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:47:04,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:47:04,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:47:04,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:47:04,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:47:04,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:47:04,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:47:04,520 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,534 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,548 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,562 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:47:04,588 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:47:04,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:47:04,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:47:04,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:04,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-18 17:47:04,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-01-18 17:47:04,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-01-18 17:47:04,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:04,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:04,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-18 17:47:04,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:04,964 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:47:04,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-18 17:47:04,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:05,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,027 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:47:05,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-18 17:47:05,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:05,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:05,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-18 17:47:05,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,114 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:47:05,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-01-18 17:47:05,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:05,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:05,175 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:47:05,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-01-18 17:47:05,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:05,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:05,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-18 17:47:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:47:05,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:47:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:47:05,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:47:05,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:47:05,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:47:05,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:47:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:47:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:47:05,350 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-18 17:47:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:47:24,653 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-18 17:47:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:47:24,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:47:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:47:24,655 INFO L225 Difference]: With dead ends: 685 [2019-01-18 17:47:24,655 INFO L226 Difference]: Without dead ends: 677 [2019-01-18 17:47:24,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:47:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-18 17:47:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-18 17:47:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-18 17:47:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-18 17:47:39,343 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-18 17:47:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:47:39,343 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-18 17:47:39,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:47:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-18 17:47:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:47:39,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:47:39,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:47:39,345 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:47:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:47:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-18 17:47:39,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:47:39,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:47:39,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:47:39,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:47:39,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:47:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:47:39,580 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-18 17:47:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:47:39,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:47:39,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:47:39,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:47:39,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:47:39,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:47:39,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:47:39,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:47:39,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:47:39,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:47:39,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:47:39,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:47:39,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:47:39,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:47:39,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:47:39,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:47:39,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:47:39,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:47:39,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:47:39,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:47:39,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:47:39,862 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,882 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,894 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,902 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:47:39,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:47:39,937 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:47:39,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:39,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:47:39,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:47:40,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:40,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-18 17:47:40,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-18 17:47:40,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:40,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,218 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:47:40,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-18 17:47:40,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:40,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:40,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-18 17:47:40,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,329 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:47:40,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-18 17:47:40,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:40,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-18 17:47:40,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:40,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:40,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-18 17:47:40,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-18 17:47:40,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:47:40,548 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:47:40,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-01-18 17:47:40,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:47:40,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:47:40,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-18 17:47:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:47:40,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:47:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:47:40,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:47:40,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-18 17:47:40,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:47:40,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:47:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:47:40,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:47:40,724 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-18 17:47:40,947 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-18 17:47:43,378 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-18 17:47:44,189 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-18 17:47:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:47:57,194 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-18 17:47:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:47:57,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-18 17:47:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:47:57,196 INFO L225 Difference]: With dead ends: 550 [2019-01-18 17:47:57,196 INFO L226 Difference]: Without dead ends: 543 [2019-01-18 17:47:57,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:47:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-18 17:48:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-18 17:48:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:48:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-18 17:48:00,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-18 17:48:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:48:00,107 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-18 17:48:00,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:48:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-18 17:48:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:48:00,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:48:00,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:48:00,107 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:48:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:48:00,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-18 17:48:00,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:48:00,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:00,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:48:00,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:00,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:48:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:48:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:48:00,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48:00,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:48:00,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 17:48:00,280 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 17:48:00,281 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:48:00,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:48:00,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:48:00,283 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:48:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:48:00,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:48:00,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48:00,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:48:00,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:48:00,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:48:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:48:00,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:48:00,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 17:48:00,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 17:48:00,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 17:48:00,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:00,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 17:48:00,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:00,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:00,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:00,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:00,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:48:00,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:48:00,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:48:00,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:48:00,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:48:00,541 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:00,944 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:01,172 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:01,339 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:01,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:01,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:01,863 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 17:48:02,071 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-18 17:48:02,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:48:02,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:02,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:02,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 17:48:02,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 17:48:02,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:02,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:02,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 17:48:02,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,203 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:02,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-18 17:48:02,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:02,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:02,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-18 17:48:02,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:02,507 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:02,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 17:48:02,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:02,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:02,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:48:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:02,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:48:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:02,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:48:02,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-18 17:48:02,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:48:02,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:48:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:48:02,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:48:02,911 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-18 17:48:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:48:08,615 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-18 17:48:08,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:48:08,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-18 17:48:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:48:08,616 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:48:08,616 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:48:08,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:48:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:48:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-18 17:48:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:48:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-18 17:48:11,753 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-18 17:48:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:48:11,753 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-18 17:48:11,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:48:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-18 17:48:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:48:11,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:48:11,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:48:11,754 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:48:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:48:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-18 17:48:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:48:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:11,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:48:11,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:11,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:48:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:48:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 17:48:11,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48:11,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:48:11,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 17:48:11,880 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-18 17:48:11,881 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:48:11,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:48:11,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:48:11,882 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:48:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:48:11,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:48:11,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48:11,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:48:11,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:48:11,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:48:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:48:11,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:48:11,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 43 treesize of output 39 [2019-01-18 17:48:11,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:48:11,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:48:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:11,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:48:11,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:48:12,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:48:12,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:48:12,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:48:12,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:48:12,068 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,087 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,099 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,108 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,118 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,144 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-18 17:48:12,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 17:48:12,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:12,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-18 17:48:12,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 17:48:12,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:48:12,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:48:12,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-18 17:48:12,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,398 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:12,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 17:48:12,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,457 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:12,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-01-18 17:48:12,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-18 17:48:12,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-18 17:48:12,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,567 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:12,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-01-18 17:48:12,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:12,635 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:12,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-18 17:48:12,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:12,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-18 17:48:12,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-18 17:48:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:12,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:48:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:12,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:48:12,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:48:12,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:48:12,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:48:12,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:48:12,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:48:12,807 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-18 17:48:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:48:18,866 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-18 17:48:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:48:18,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-18 17:48:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:48:18,867 INFO L225 Difference]: With dead ends: 74 [2019-01-18 17:48:18,867 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:48:18,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:48:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:48:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-18 17:48:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:48:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-18 17:48:22,279 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-18 17:48:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:48:22,279 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-18 17:48:22,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:48:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-18 17:48:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:48:22,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:48:22,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:48:22,279 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:48:22,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:48:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-18 17:48:22,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:48:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:48:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:22,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:48:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:48:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:48:22,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48:22,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:48:22,411 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 17:48:22,411 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 17:48:22,412 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:48:22,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:48:22,413 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:48:22,413 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:48:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:48:22,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:48:22,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48:22,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:48:22,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:48:22,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:48:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:48:22,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:48:22,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 17:48:22,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-18 17:48:22,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-18 17:48:22,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 17:48:22,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:48:22,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:48:22,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 17:48:22,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 17:48:22,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 17:48:22,607 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,631 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,643 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,652 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:22,688 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 17:48:22,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:48:22,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:22,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 17:48:22,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 17:48:22,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:22,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-18 17:48:22,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,893 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:22,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-18 17:48:22,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:22,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 17:48:22,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:22,947 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:22,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-18 17:48:22,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:22,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:22,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 17:48:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:22,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:48:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:23,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:48:23,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-18 17:48:23,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:48:23,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:48:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:48:23,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:48:23,053 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-18 17:48:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:48:30,026 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-18 17:48:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:48:30,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-18 17:48:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:48:30,027 INFO L225 Difference]: With dead ends: 80 [2019-01-18 17:48:30,027 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:48:30,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:48:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:48:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-18 17:48:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 17:48:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-18 17:48:36,259 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-18 17:48:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:48:36,259 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-18 17:48:36,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:48:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-18 17:48:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:48:36,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:48:36,260 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:48:36,260 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:48:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:48:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-18 17:48:36,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:48:36,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:36,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:48:36,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:48:36,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:48:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:48:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-18 17:48:36,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48:36,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:48:36,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:48:36,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:48:36,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:48: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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:48:36,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:48:36,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:48:36,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:48:36,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:48:36,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:48:36,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 18 treesize of output 21 [2019-01-18 17:48:36,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:48:36,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:48:36,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 17:48:36,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 17:48:36,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 17:48:36,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-18 17:48:36,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-18 17:48:36,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-18 17:48:36,491 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,498 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,512 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:48:36,528 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-18 17:48:36,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:48:36,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 17:48:36,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 17:48:36,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-18 17:48:36,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-18 17:48:36,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-18 17:48:36,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 17:48:36,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-18 17:48:36,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-18 17:48:36,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-18 17:48:36,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 17:48:36,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-18 17:48:36,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-18 17:48:36,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-18 17:48:36,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 17:48:36,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-18 17:48:36,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:48:36,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-01-18 17:48:36,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:48:36,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-18 17:48:36,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 17:48:36,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 17:48:36,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-18 17:48:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:36,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:48:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:48:37,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:48:37,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-18 17:48:37,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:48:37,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:48:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:48:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:48:37,049 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-18 17:48:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:48:43,644 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-18 17:48:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:48:43,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-18 17:48:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:48:43,645 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:48:43,645 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 17:48:43,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:48:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 17:48:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 17:48:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 17:48:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 17:48:43,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-18 17:48:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:48:43,647 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 17:48:43,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:48:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 17:48:43,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 17:48:43,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 17:48:44,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:45,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:52,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:52,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:53,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:53,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:53,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:53,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:53,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:54,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:55,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:55,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:55,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:48:59,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:49:14,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:49:15,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:49:24,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:49:57,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:50:15,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:50:29,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:52:09,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent.