java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:52:38,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:52:38,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:52:38,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:52:38,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:52:38,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:52:38,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:52:38,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:52:38,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:52:38,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:52:38,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:52:38,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:52:38,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:52:38,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:52:38,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:52:38,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:52:38,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:52:38,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:52:38,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:52:38,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:52:38,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:52:38,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:52:38,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:52:38,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:52:38,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:52:38,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:52:38,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:52:38,201 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:52:38,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:52:38,203 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:52:38,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:52:38,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:52:38,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:52:38,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:52:38,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:52:38,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:52:38,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:52:38,229 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:52:38,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:52:38,230 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:52:38,231 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:52:38,231 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:52:38,231 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:52:38,231 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:52:38,231 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:52:38,231 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:52:38,232 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:52:38,232 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:52:38,232 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:52:38,232 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:52:38,233 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:52:38,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:52:38,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:52:38,233 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:52:38,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:52:38,234 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:52:38,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:52:38,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:52:38,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:52:38,235 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:52:38,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:52:38,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:52:38,235 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:52:38,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:52:38,236 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:52:38,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:52:38,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:52:38,236 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:52:38,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:52:38,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:52:38,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:52:38,237 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:52:38,237 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:52:38,237 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:52:38,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:52:38,238 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:52:38,238 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:52:38,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:52:38,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:52:38,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:52:38,287 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:52:38,287 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:52:38,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-02-15 10:52:38,288 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-02-15 10:52:38,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:52:38,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:52:38,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:52:38,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:52:38,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:52:38,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:52:38,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:52:38,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:52:38,378 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:52:38,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... [2019-02-15 10:52:38,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:52:38,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:52:38,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:52:38,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:52:38,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:52:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:52:38,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:52:38,732 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:52:38,733 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-15 10:52:38,741 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:52:38 BoogieIcfgContainer [2019-02-15 10:52:38,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:52:38,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:52:38,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:52:38,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:52:38,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:52:38" (1/2) ... [2019-02-15 10:52:38,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9ce322 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:52:38, skipping insertion in model container [2019-02-15 10:52:38,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:52:38" (2/2) ... [2019-02-15 10:52:38,761 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-02-15 10:52:38,785 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:52:38,802 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-15 10:52:38,829 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-15 10:52:38,875 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:52:38,875 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:52:38,875 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:52:38,875 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:52:38,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:52:38,876 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:52:38,876 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:52:38,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:52:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-15 10:52:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:52:38,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:38,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:52:38,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-15 10:52:38,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:38,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:38,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:52:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:52:39,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:52:39,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:52:39,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:52:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:52:39,166 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-15 10:52:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:39,348 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-15 10:52:39,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:52:39,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:52:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:39,363 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:52:39,364 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 10:52:39,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:52:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 10:52:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-15 10:52:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 10:52:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-15 10:52:39,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-15 10:52:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:39,401 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-15 10:52:39,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:52:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-15 10:52:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:52:39,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:39,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:52:39,403 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:39,404 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-15 10:52:39,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:39,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:39,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:39,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:39,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:39,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:39,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:52:39,566 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-15 10:52:39,607 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:39,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:39,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:39,671 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:39,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:39,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:39,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:39,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:39,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:39,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:39,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:39,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,787 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-02-15 10:52:39,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:52:39,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:39,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:39,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:52:39,915 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:40,022 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:40,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:40,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:40,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:40,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:40,423 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:40,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:40,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:52:40,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:40,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:40,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:40,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:40,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:40,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:52:40,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:40,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:52:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:52:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:40,756 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-15 10:52:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:41,481 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-15 10:52:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:52:41,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:52:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:41,483 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:52:41,483 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 10:52:41,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:52:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 10:52:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-15 10:52:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:52:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-15 10:52:41,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-15 10:52:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:41,494 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-15 10:52:41,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:52:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-15 10:52:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:52:41,495 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:41,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:52:41,495 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-15 10:52:41,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:41,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:41,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:41,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:41,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:41,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:41,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:41,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:52:41,672 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-15 10:52:41,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:41,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:41,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:41,682 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:41,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:41,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:41,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:41,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:41,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:41,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:41,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:41,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:52:41,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:52:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:41,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:52:41,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:41,821 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:41,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:41,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:41,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:41,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:41,894 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:41,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:41,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:52:41,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:42,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:42,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:42,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:42,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:52:42,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:52:42,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:52:42,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:52:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:52:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:42,080 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-15 10:52:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:42,198 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-15 10:52:42,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:52:42,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:52:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:42,201 INFO L225 Difference]: With dead ends: 18 [2019-02-15 10:52:42,201 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:52:42,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:52:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 10:52:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:52:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-15 10:52:42,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-15 10:52:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:42,207 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-15 10:52:42,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:52:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-15 10:52:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:52:42,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:42,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:52:42,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-15 10:52:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:42,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:42,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:42,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:52:42,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:52:42,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:52:42,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:52:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:52:42,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:52:42,243 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-15 10:52:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:42,308 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-15 10:52:42,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:52:42,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:52:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:42,309 INFO L225 Difference]: With dead ends: 21 [2019-02-15 10:52:42,309 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 10:52:42,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:52:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 10:52:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-15 10:52:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:52:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-15 10:52:42,314 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-15 10:52:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:42,314 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-15 10:52:42,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:52:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-15 10:52:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:52:42,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:42,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:52:42,316 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-15 10:52:42,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:42,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:42,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:42,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:42,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:42,414 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:52:42,414 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-15 10:52:42,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:42,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:42,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:42,424 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:42,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:42,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:42,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:42,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:42,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:42,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:42,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:42,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,463 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-02-15 10:52:42,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:52:42,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,517 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-02-15 10:52:42,518 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:42,586 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:42,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:42,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:42,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:42,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:42,663 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:42,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:42,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:52:42,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:42,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-02-15 10:52:42,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:42,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:42,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:42,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:52:42,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:42,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:52:42,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:52:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:42,897 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-15 10:52:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:43,161 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-15 10:52:43,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:52:43,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:52:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:43,166 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:52:43,166 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 10:52:43,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:52:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 10:52:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-15 10:52:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 10:52:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-15 10:52:43,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-15 10:52:43,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:43,173 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-15 10:52:43,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:52:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-15 10:52:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:43,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:43,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:43,174 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-15 10:52:43,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:43,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:43,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:43,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:43,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:43,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:43,292 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-15 10:52:43,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:43,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:43,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:43,301 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:43,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:43,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:43,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:43,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:43,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:43,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:43,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:52:43,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:52:43,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:52:43,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:43,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,386 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-02-15 10:52:43,387 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:43,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:43,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:43,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:43,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:43,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:43,542 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:43,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:52:43,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:43,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:43,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:43,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:43,754 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-02-15 10:52:43,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:52:43,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:43,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:43,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:52:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:43,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:43,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:43,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:52:43,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:43,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:43,904 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-15 10:52:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:44,503 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-02-15 10:52:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:52:44,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:52:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:44,505 INFO L225 Difference]: With dead ends: 49 [2019-02-15 10:52:44,505 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 10:52:44,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 10:52:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-02-15 10:52:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 10:52:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-15 10:52:44,512 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-15 10:52:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:44,513 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-15 10:52:44,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-15 10:52:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:44,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:44,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:44,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-02-15 10:52:44,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:44,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:44,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:44,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:44,647 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:44,648 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-15 10:52:44,650 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:44,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:44,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:44,657 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:44,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:44,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:44,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:44,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:44,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:44,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:44,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 18 treesize of output 21 [2019-02-15 10:52:44,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,698 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-02-15 10:52:44,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:52:44,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:44,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,734 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-02-15 10:52:44,735 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,761 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,790 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:44,823 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:44,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:44,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:52:44,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:44,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:45,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:45,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:52:45,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:45,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:45,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:52:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:45,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:45,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:45,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:52:45,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:45,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:45,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:52:45,226 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-15 10:52:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:45,910 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-02-15 10:52:45,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:52:45,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:52:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:45,912 INFO L225 Difference]: With dead ends: 47 [2019-02-15 10:52:45,912 INFO L226 Difference]: Without dead ends: 46 [2019-02-15 10:52:45,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-15 10:52:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-02-15 10:52:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 10:52:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-02-15 10:52:45,921 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-02-15 10:52:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:45,921 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-02-15 10:52:45,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-02-15 10:52:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:45,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:45,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:45,922 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-15 10:52:45,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:45,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:45,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:45,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:45,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:45,976 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:45,977 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-15 10:52:45,979 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:45,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:45,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:45,990 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:45,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:45,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:45,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:46,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:46,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:46,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:46,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:52:46,018 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-02-15 10:52:46,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:52:46,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:52:46,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,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, 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-02-15 10:52:46,067 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,105 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:46,157 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:52:46,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:52:46,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:46,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:52:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:46,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:52:46,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:52:46,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:52:46,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:52:46,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:52:46,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:46,342 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-02-15 10:52:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:46,397 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-02-15 10:52:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:52:46,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:52:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:46,398 INFO L225 Difference]: With dead ends: 28 [2019-02-15 10:52:46,398 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 10:52:46,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 10:52:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-15 10:52:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:52:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-02-15 10:52:46,405 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-02-15 10:52:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:46,405 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-02-15 10:52:46,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:52:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-02-15 10:52:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:46,406 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:46,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:46,406 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-15 10:52:46,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:46,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:46,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:46,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:46,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:46,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:46,527 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-15 10:52:46,529 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:46,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:46,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:46,536 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:46,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:46,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:46,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:46,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:46,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:46,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:46,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:46,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,566 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-02-15 10:52:46,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:52:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:52:46,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:52:46,605 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:46,691 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:46,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:52:46,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:46,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:46,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:46,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:46,959 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:46,959 INFO L303 Elim1Store]: Index analysis took 138 ms [2019-02-15 10:52:46,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 10:52:46,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:47,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-02-15 10:52:47,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:52:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:47,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:47,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:47,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:52:47,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:47,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:47,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:47,085 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-02-15 10:52:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:47,592 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-02-15 10:52:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:52:47,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:52:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:47,594 INFO L225 Difference]: With dead ends: 44 [2019-02-15 10:52:47,594 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 10:52:47,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 10:52:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-02-15 10:52:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:52:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-02-15 10:52:47,601 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-02-15 10:52:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:47,601 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-02-15 10:52:47,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-02-15 10:52:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:47,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:47,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:47,602 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-15 10:52:47,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:47,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:47,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:47,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:47,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:47,647 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:47,647 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-15 10:52:47,649 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:47,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:47,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:47,654 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:47,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:47,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:47,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:47,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:47,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:47,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:47,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:47,679 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-02-15 10:52:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:52:47,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:52:47,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:52:47,723 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:47,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:47,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:47,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:47,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:47,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:47,793 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:52:47,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:47,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:52:47,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:47,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:47,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:52:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:47,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:47,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:47,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:52:47,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:47,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:52:47,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:52:47,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:48,000 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-02-15 10:52:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:48,251 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-02-15 10:52:48,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:52:48,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:52:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:48,252 INFO L225 Difference]: With dead ends: 43 [2019-02-15 10:52:48,252 INFO L226 Difference]: Without dead ends: 42 [2019-02-15 10:52:48,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:52:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-15 10:52:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-02-15 10:52:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:52:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-02-15 10:52:48,259 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-02-15 10:52:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:48,260 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-02-15 10:52:48,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:52:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-02-15 10:52:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:48,260 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:48,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:48,261 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-15 10:52:48,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:48,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:48,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:48,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:48,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:48,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:48,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:48,404 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-15 10:52:48,406 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:48,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:48,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:48,411 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:48,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:48,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:48,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:48,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:48,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:48,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:48,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:48,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,454 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-02-15 10:52:48,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:52:48,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:52:48,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:52:48,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:48,609 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:48,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:52:48,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:48,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:48,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:48,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:52:48,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:48,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:48,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:48,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:48,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:52:48,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:48,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:48,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:48,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:48,919 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-02-15 10:52:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:49,391 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-02-15 10:52:49,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:52:49,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:52:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:49,392 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:52:49,392 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:52:49,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:52:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-02-15 10:52:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 10:52:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-02-15 10:52:49,404 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-02-15 10:52:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:49,404 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-02-15 10:52:49,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-02-15 10:52:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:49,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:49,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:49,405 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-02-15 10:52:49,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:49,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:49,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:49,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:49,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:49,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:49,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:49,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:49,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:49,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:49,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:49,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:49,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:52:49,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:49,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:49,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:52:49,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:52:49,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:52:49,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,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, 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-02-15 10:52:49,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:52:49,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:49,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:49,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:49,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:49,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:49,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:49,745 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:49,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:52:49,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:49,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:49,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:49,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:49,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:52:49,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:49,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:49,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:49,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:50,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:50,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:52:50,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:50,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:50,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:50,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:52:50,045 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-02-15 10:52:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:50,436 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-02-15 10:52:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:52:50,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:52:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:50,437 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:52:50,437 INFO L226 Difference]: Without dead ends: 64 [2019-02-15 10:52:50,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-15 10:52:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-02-15 10:52:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:52:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-02-15 10:52:50,447 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-02-15 10:52:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:50,447 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-02-15 10:52:50,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-02-15 10:52:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:50,448 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:50,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:50,448 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-15 10:52:50,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:50,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:50,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:50,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:50,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:50,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:50,508 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-02-15 10:52:50,510 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:50,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:50,515 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:50,515 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:50,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:50,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:50,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:50,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:50,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:50,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:50,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:52:50,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,554 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-02-15 10:52:50,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:52:50,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:50,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,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, 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-02-15 10:52:50,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:50,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:50,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:50,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:50,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:50,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:50,671 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:50,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:50,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:52:50,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:50,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:50,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:50,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:50,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:50,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:52:50,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:50,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:52:50,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:52:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:50,812 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-02-15 10:52:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:50,997 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-02-15 10:52:50,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:52:50,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:52:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:50,999 INFO L225 Difference]: With dead ends: 45 [2019-02-15 10:52:50,999 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 10:52:50,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:52:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 10:52:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-02-15 10:52:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 10:52:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-02-15 10:52:51,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-02-15 10:52:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:51,009 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-02-15 10:52:51,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:52:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-02-15 10:52:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:51,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:51,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:51,010 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:51,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-02-15 10:52:51,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:51,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:51,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:52:51,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:52:51,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:52:51,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:52:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:52:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:52:51,036 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-02-15 10:52:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:51,067 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-02-15 10:52:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:52:51,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 10:52:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:51,068 INFO L225 Difference]: With dead ends: 34 [2019-02-15 10:52:51,068 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 10:52:51,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:52:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 10:52:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-15 10:52:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:52:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-02-15 10:52:51,077 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-02-15 10:52:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:51,077 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-02-15 10:52:51,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:52:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-02-15 10:52:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:51,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:51,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:51,078 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:51,079 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-15 10:52:51,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:51,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:51,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:51,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:51,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:51,212 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:51,212 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-15 10:52:51,212 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:51,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:51,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:51,217 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:51,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:51,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:51,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:51,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:51,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:51,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:51,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:51,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,248 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-02-15 10:52:51,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,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 23 treesize of output 37 [2019-02-15 10:52:51,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,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-02-15 10:52:51,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:52:51,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:51,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:51,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:51,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:51,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:51,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:51,386 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:51,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:52:51,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:51,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:51,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:51,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:52:51,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:51,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:51,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:52:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:51,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:51,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:52:51,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:51,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:51,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:52:51,613 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-02-15 10:52:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:51,949 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-02-15 10:52:51,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:52:51,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:52:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:51,950 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:52:51,950 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 10:52:51,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 10:52:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-02-15 10:52:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 10:52:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-02-15 10:52:51,959 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-02-15 10:52:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:51,959 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-02-15 10:52:51,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-02-15 10:52:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:51,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:51,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:51,961 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-15 10:52:51,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:51,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:51,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:51,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:51,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:52,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:52,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:52,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:52,033 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-15 10:52:52,036 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:52,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:52,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:52,042 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:52,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:52,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:52,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:52,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:52,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:52,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:52,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:52,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:52:52,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:52:52,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:52:52,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:52:52,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:52,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:52,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:52,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:52,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:52,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-02-15 10:52:52,184 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:52:52,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:52,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:52:52,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:52,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:52,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:52:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:52,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:52,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:52,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:52:52,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:52,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:52:52,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:52:52,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:52,287 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-02-15 10:52:52,750 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-02-15 10:52:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:53,173 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-02-15 10:52:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:52:53,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:52:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:53,174 INFO L225 Difference]: With dead ends: 51 [2019-02-15 10:52:53,174 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 10:52:53,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:52:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 10:52:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-15 10:52:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 10:52:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-02-15 10:52:53,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-02-15 10:52:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:53,186 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-02-15 10:52:53,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:52:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-02-15 10:52:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:52:53,186 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:53,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:52:53,187 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-15 10:52:53,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:53,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:53,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:53,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:53,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:52:53,306 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-15 10:52:53,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:53,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:53,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:53,313 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:53,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:53,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:53,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:53,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:53,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:53,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:53,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:52:53,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,342 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-02-15 10:52:53,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:52:53,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:52:53,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,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, 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-02-15 10:52:53,385 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:53,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:53,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:53,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:53,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:53,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:53,485 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:53,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:52:53,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:53,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:53,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:53,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:53,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 36 treesize of output 86 [2019-02-15 10:52:53,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:53,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:53,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:53,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:53,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:53,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:52:53,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:53,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:53,777 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-02-15 10:52:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:54,281 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-02-15 10:52:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:52:54,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:52:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:54,283 INFO L225 Difference]: With dead ends: 64 [2019-02-15 10:52:54,283 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 10:52:54,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 10:52:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-02-15 10:52:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:52:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-15 10:52:54,292 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-02-15 10:52:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:54,292 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-15 10:52:54,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-15 10:52:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:52:54,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:54,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:52:54,293 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:54,294 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-15 10:52:54,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:54,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:54,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:54,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:54,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:54,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:54,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:52:54,421 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-15 10:52:54,422 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:54,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:54,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:54,426 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:54,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:54,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:54,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:54,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:54,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:54,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:54,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:52:54,454 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-02-15 10:52:54,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:52:54,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:52:54,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:52:54,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:54,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:54,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:54,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:54,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:54,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:54,577 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:52:54,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:52:54,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:54,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:54,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:52:54,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:54,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 33 treesize of output 59 [2019-02-15 10:52:54,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:54,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:54,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:52:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:54,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:54,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:54,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:52:54,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:54,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:54,806 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-02-15 10:52:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:55,126 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-02-15 10:52:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:52:55,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:52:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:55,128 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:52:55,128 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 10:52:55,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 10:52:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-02-15 10:52:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:52:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-02-15 10:52:55,137 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-02-15 10:52:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:55,138 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-02-15 10:52:55,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-02-15 10:52:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:52:55,138 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:55,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:52:55,139 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-15 10:52:55,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:55,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:55,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:55,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:55,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:55,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:52:55,298 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-15 10:52:55,299 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:55,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:55,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:55,303 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:52:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:55,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:55,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:55,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:55,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:55,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:55,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:52:55,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,362 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-02-15 10:52:55,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:52:55,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:55,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,558 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-02-15 10:52:55,559 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:55,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:55,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:55,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:55,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:55,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:55,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:55,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:52:55,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:55,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:55,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:55,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:52:55,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:55,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:55,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:52:55,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,971 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:55,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:55,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:52:55,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:56,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:56,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:52:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:56,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:56,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:56,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:52:56,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:56,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:52:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:52:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:52:56,143 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-02-15 10:52:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:57,182 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-02-15 10:52:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:52:57,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:52:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:57,184 INFO L225 Difference]: With dead ends: 68 [2019-02-15 10:52:57,184 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 10:52:57,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:52:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 10:52:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-02-15 10:52:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:52:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-15 10:52:57,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-02-15 10:52:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:57,200 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-15 10:52:57,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:52:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-15 10:52:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:52:57,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:57,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:52:57,205 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-15 10:52:57,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:57,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:57,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:57,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:57,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:57,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:52:57,388 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-15 10:52:57,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:57,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:57,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:57,392 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:52:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:57,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:57,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:57,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:57,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:57,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:57,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:52:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:52:57,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:52:57,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:57,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:52:57,444 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:57,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:57,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:57,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:57,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:57,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:57,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:57,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:52:57,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:57,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:57,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:57,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:57,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:52:57,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:57,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:57,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:52:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:57,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:57,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:57,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:52:57,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:57,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:52:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:52:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:52:57,798 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-02-15 10:52:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:58,210 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-02-15 10:52:58,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:52:58,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:52:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:58,211 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:52:58,211 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:52:58,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:52:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-02-15 10:52:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:52:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-15 10:52:58,222 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-02-15 10:52:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:58,222 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-15 10:52:58,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:52:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-15 10:52:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:52:58,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:58,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:52:58,223 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-02-15 10:52:58,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:58,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:58,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:58,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:58,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:58,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:58,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:58,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:52:58,288 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-15 10:52:58,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:58,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:58,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:58,293 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:52:58,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:58,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:58,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:58,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:58,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:58,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:58,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:58,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:52:58,336 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-02-15 10:52:58,344 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-02-15 10:52:58,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:52:58,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:52:58,374 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:58,438 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-15 10:52:58,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:52:58,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:58,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:52:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:58,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:52:58,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:52:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:52:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:52:58,533 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-02-15 10:52:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:58,671 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-02-15 10:52:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:52:58,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 10:52:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:58,672 INFO L225 Difference]: With dead ends: 45 [2019-02-15 10:52:58,673 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 10:52:58,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:52:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 10:52:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-02-15 10:52:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 10:52:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-02-15 10:52:58,683 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-02-15 10:52:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:58,683 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-02-15 10:52:58,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:52:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-02-15 10:52:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:52:58,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:58,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:52:58,684 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-02-15 10:52:58,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:58,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:58,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:58,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:58,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:58,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:52:58,787 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-02-15 10:52:58,788 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:58,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:58,792 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:58,792 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:52:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:58,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:58,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:58,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:58,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:58,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:58,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:52:58,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:52:58,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:52:58,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:52:58,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:58,852 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-02-15 10:52:58,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:59,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:59,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:59,288 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:52:59,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:52:59,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:59,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:59,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:52:59,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,609 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:59,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 10:52:59,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:59,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:59,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:52:59,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:59,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-15 10:52:59,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:59,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:59,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:52:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:59,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:59,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:59,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:52:59,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:59,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:52:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:52:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:59,832 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-02-15 10:53:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:00,408 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-02-15 10:53:00,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:00,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:53:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:00,413 INFO L225 Difference]: With dead ends: 71 [2019-02-15 10:53:00,413 INFO L226 Difference]: Without dead ends: 70 [2019-02-15 10:53:00,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:53:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-15 10:53:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-02-15 10:53:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:53:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-02-15 10:53:00,424 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-02-15 10:53:00,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:00,424 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-02-15 10:53:00,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-02-15 10:53:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:00,425 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:00,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:00,425 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-15 10:53:00,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:00,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:00,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:00,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:00,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:00,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:00,518 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:00,519 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-15 10:53:00,519 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:00,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:00,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:00,523 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:00,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:00,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:00,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:00,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:00,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:00,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:00,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:00,549 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-02-15 10:53:00,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:00,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:00,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,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, 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-02-15 10:53:00,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:00,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:00,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:00,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:00,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:00,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:00,651 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:00,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:53:00,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:00,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:00,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:00,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:00,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:53:00,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:00,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:00,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:00,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:00,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:00,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:00,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:00,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:00,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:00,928 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-02-15 10:53:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:01,209 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-02-15 10:53:01,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:01,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:01,210 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:53:01,210 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 10:53:01,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 10:53:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-02-15 10:53:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:53:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-15 10:53:01,230 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-02-15 10:53:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:01,230 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-15 10:53:01,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-15 10:53:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:01,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:01,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:01,231 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-15 10:53:01,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:01,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:01,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:01,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:01,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:01,537 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-02-15 10:53:01,772 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-02-15 10:53:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:01,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:01,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:01,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:01,798 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-15 10:53:01,799 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:01,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:01,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:01,802 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:01,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:01,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:01,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:01,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:01,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:01,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:01,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:01,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:01,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:01,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:01,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,858 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-02-15 10:53:01,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:01,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:01,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:01,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:01,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:01,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:01,942 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:01,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:01,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:01,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:02,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:02,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:02,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:02,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:02,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:02,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:02,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,249 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:02,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:02,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:53:02,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:02,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:02,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:02,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:02,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:02,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:02,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:02,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:02,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:02,505 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-02-15 10:53:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:03,308 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-02-15 10:53:03,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:03,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:53:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:03,310 INFO L225 Difference]: With dead ends: 71 [2019-02-15 10:53:03,310 INFO L226 Difference]: Without dead ends: 70 [2019-02-15 10:53:03,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-15 10:53:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-02-15 10:53:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:53:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-02-15 10:53:03,318 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-02-15 10:53:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:03,319 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-02-15 10:53:03,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-02-15 10:53:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:03,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:03,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:03,319 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-15 10:53:03,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:03,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:03,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:03,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:03,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:03,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:03,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:03,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:03,417 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-15 10:53:03,418 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:03,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:03,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:03,421 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:03,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:03,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:03,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:03,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:03,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:03,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 18 treesize of output 21 [2019-02-15 10:53:03,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,448 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-02-15 10:53:03,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:03,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:03,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:03,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:03,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:03,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:03,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:03,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:03,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:03,558 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:03,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:03,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:03,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:03,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:03,839 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-15 10:53:03,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:03,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:04,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:04,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:04,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:04,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:04,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:04,164 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:04,164 INFO L303 Elim1Store]: Index analysis took 322 ms [2019-02-15 10:53:04,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:04,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:04,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:04,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:04,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:04,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:04,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:04,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:04,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:04,786 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-02-15 10:53:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:05,150 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-02-15 10:53:05,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:05,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:05,152 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:53:05,152 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:53:05,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:53:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-02-15 10:53:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:53:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-15 10:53:05,164 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-02-15 10:53:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:05,164 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-15 10:53:05,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-15 10:53:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:05,165 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:05,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:05,165 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-02-15 10:53:05,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:05,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:05,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:05,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:05,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:05,347 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-02-15 10:53:05,348 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:05,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:05,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:05,351 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:05,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:05,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:05,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:05,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:05,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:05,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:05,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,404 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-02-15 10:53:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:05,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:53:05,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:53:05,444 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:05,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:05,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:05,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:05,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:05,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,635 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:05,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:05,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:05,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:05,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:05,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:05,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:05,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:05,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:05,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:05,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:05,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:05,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:05,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:05,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:05,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:05,867 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-02-15 10:53:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:06,498 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-02-15 10:53:06,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:06,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:53:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:06,500 INFO L225 Difference]: With dead ends: 93 [2019-02-15 10:53:06,500 INFO L226 Difference]: Without dead ends: 92 [2019-02-15 10:53:06,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-15 10:53:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-02-15 10:53:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 10:53:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-02-15 10:53:06,513 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-02-15 10:53:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:06,513 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-02-15 10:53:06,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-02-15 10:53:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:06,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:06,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:06,513 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-15 10:53:06,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:06,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:06,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:06,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:06,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:06,782 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-15 10:53:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:06,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:06,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:06,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:06,857 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-15 10:53:06,858 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:06,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:06,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:06,861 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:53:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:06,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:06,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:06,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:06,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:06,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:06,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:06,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:06,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, 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-02-15 10:53:06,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:06,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:53:06,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:53:07,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:07,062 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-15 10:53:07,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:53:07,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,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-02-15 10:53:07,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:53:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:07,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:07,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:53:07,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:53:07,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:53:07,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:53:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:53:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:53:07,145 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-02-15 10:53:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:07,191 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-02-15 10:53:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:53:07,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:53:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:07,192 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:53:07,192 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:53:07,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:53:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:53:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-02-15 10:53:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 10:53:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-02-15 10:53:07,207 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-02-15 10:53:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:07,207 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-02-15 10:53:07,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:53:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-02-15 10:53:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:07,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:07,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:07,208 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:07,208 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-02-15 10:53:07,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:07,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:07,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:07,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:07,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:07,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:07,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:07,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:07,277 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-15 10:53:07,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:07,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:07,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:07,283 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:07,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:07,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:07,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:07,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:07,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:07,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:07,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 18 treesize of output 21 [2019-02-15 10:53:07,308 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-02-15 10:53:07,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:07,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:07,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:07,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:07,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,375 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:07,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:08,305 WARN L181 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 10:53:08,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,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 51 [2019-02-15 10:53:08,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:08,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:08,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:08,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:08,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:53:08,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:08,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-02-15 10:53:08,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:08,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:08,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:08,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:08,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:08,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:08,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:08,487 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-02-15 10:53:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:08,829 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-02-15 10:53:08,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:08,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:08,831 INFO L225 Difference]: With dead ends: 85 [2019-02-15 10:53:08,831 INFO L226 Difference]: Without dead ends: 84 [2019-02-15 10:53:08,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:53:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-15 10:53:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-02-15 10:53:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-15 10:53:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-02-15 10:53:08,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-02-15 10:53:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:08,848 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-02-15 10:53:08,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-02-15 10:53:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:08,848 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:08,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:08,849 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-02-15 10:53:08,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:08,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:08,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:08,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:08,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:09,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:09,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:09,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:09,012 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-02-15 10:53:09,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:09,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:09,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:09,016 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:09,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:09,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:09,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:09,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:09,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:09,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:09,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:09,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:53:09,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:09,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:09,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,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, 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-02-15 10:53:09,073 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,105 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:09,160 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:09,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,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-02-15 10:53:09,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:09,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:09,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:09,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:09,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:09,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:09,363 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:09,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:53:09,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:09,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:09,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:09,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:09,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:09,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:09,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:09,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:09,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:09,552 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-02-15 10:53:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:10,306 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-02-15 10:53:10,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:10,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:53:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:10,308 INFO L225 Difference]: With dead ends: 96 [2019-02-15 10:53:10,308 INFO L226 Difference]: Without dead ends: 94 [2019-02-15 10:53:10,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-15 10:53:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-02-15 10:53:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:53:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-02-15 10:53:10,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-02-15 10:53:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:10,326 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-02-15 10:53:10,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-02-15 10:53:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:10,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:10,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:10,327 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-15 10:53:10,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:10,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:10,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:10,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:10,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:10,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:10,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:10,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:10,427 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-15 10:53:10,429 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:10,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:10,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:10,432 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:10,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:10,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:10,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:10,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:10,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:10,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:10,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:10,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:10,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:10,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:10,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:53:10,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:10,604 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:10,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:10,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,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-02-15 10:53:10,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:10,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:10,697 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:10,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:53:10,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:10,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:10,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-02-15 10:53:10,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:10,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:10,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:10,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:10,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:10,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:10,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:10,799 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-02-15 10:53:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:11,143 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-02-15 10:53:11,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:11,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:11,145 INFO L225 Difference]: With dead ends: 82 [2019-02-15 10:53:11,145 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 10:53:11,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 10:53:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-02-15 10:53:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:53:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-02-15 10:53:11,165 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-02-15 10:53:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:11,165 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-02-15 10:53:11,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-02-15 10:53:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:11,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:11,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:11,167 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-15 10:53:11,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:11,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:11,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:11,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:11,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:11,279 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-15 10:53:11,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:11,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:11,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:11,283 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:11,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:11,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:11,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:11,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:11,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:11,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:11,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:11,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:11,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:11,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:53:11,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,497 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-02-15 10:53:11,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:11,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:11,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:11,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:11,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:11,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:11,580 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:11,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:11,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:11,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:11,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:11,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:11,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:11,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:11,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:11,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:11,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:11,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:11,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:53:11,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:11,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:53:11,909 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-02-15 10:53:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:12,225 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-02-15 10:53:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:12,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:12,227 INFO L225 Difference]: With dead ends: 87 [2019-02-15 10:53:12,227 INFO L226 Difference]: Without dead ends: 86 [2019-02-15 10:53:12,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-15 10:53:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-02-15 10:53:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 10:53:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-02-15 10:53:12,249 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-02-15 10:53:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:12,249 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-02-15 10:53:12,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-02-15 10:53:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:12,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:12,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:12,250 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-15 10:53:12,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:12,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:12,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:12,434 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-15 10:53:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:12,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:12,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:12,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:12,459 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-15 10:53:12,462 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:12,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:12,464 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:12,464 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:12,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:12,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:12,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:12,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:12,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:12,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:12,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,491 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-02-15 10:53:12,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:12,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:12,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:12,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:12,617 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:12,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:12,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:12,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:12,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:12,733 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:12,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:12,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:12,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:12,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:12,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:12,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:12,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:12,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:12,843 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-02-15 10:53:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:13,236 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-02-15 10:53:13,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:13,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:13,237 INFO L225 Difference]: With dead ends: 86 [2019-02-15 10:53:13,237 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:53:13,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:53:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-02-15 10:53:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 10:53:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-02-15 10:53:13,257 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-02-15 10:53:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:13,257 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-02-15 10:53:13,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-02-15 10:53:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:13,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:13,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:13,258 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:13,259 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-02-15 10:53:13,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:13,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:13,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:13,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:13,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:13,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:13,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:13,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:13,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:13,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:13,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:53:13,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:13,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:13,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:13,394 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-02-15 10:53:13,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:13,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:13,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:13,450 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:13,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:13,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:13,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:13,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:13,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:13,516 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:13,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:13,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:13,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:13,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:13,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:13,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:53:13,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:13,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:13,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:13,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:13,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:13,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:53:13,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:13,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:13,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:53:13,728 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-02-15 10:53:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:14,627 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-02-15 10:53:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:14,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:14,628 INFO L225 Difference]: With dead ends: 110 [2019-02-15 10:53:14,628 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 10:53:14,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 10:53:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-02-15 10:53:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 10:53:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-02-15 10:53:14,648 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-02-15 10:53:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:14,648 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-02-15 10:53:14,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-02-15 10:53:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:14,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:14,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:14,649 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-15 10:53:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:14,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:14,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:14,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:14,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:14,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:14,779 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-02-15 10:53:14,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:14,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:14,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:14,784 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:53:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:14,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:14,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:14,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:14,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:14,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:14,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-02-15 10:53:14,807 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-02-15 10:53:14,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:14,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:14,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:53:14,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,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-02-15 10:53:14,908 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:14,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:14,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:14,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:14,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:14,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:15,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:53:15,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:15,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:53:15,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:53:15,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:53:15,014 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-02-15 10:53:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:15,253 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-02-15 10:53:15,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:53:15,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 10:53:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:15,255 INFO L225 Difference]: With dead ends: 87 [2019-02-15 10:53:15,255 INFO L226 Difference]: Without dead ends: 86 [2019-02-15 10:53:15,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:53:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-15 10:53:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-02-15 10:53:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-15 10:53:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-02-15 10:53:15,274 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-02-15 10:53:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:15,274 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-02-15 10:53:15,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:53:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-02-15 10:53:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:15,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:15,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:15,276 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-02-15 10:53:15,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:15,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:15,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:15,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:15,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:15,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:15,395 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:15,395 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-02-15 10:53:15,396 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:15,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:15,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:15,399 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:15,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:15,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:15,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:15,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:15,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:15,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:15,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:15,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:15,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:15,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:53:15,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:15,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:15,520 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:15,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:15,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:15,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:15,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,635 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:15,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:15,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:15,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:15,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:15,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:15,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:15,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:15,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:15,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:15,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:15,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:15,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:15,853 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-02-15 10:53:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:16,412 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-02-15 10:53:16,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:16,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:53:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:16,414 INFO L225 Difference]: With dead ends: 133 [2019-02-15 10:53:16,414 INFO L226 Difference]: Without dead ends: 132 [2019-02-15 10:53:16,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-02-15 10:53:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-02-15 10:53:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 10:53:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-02-15 10:53:16,437 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-02-15 10:53:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:16,437 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-02-15 10:53:16,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-02-15 10:53:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:53:16,438 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:16,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:53:16,438 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-02-15 10:53:16,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:16,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:16,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:16,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:16,710 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-15 10:53:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:16,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:16,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:16,721 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:53:16,722 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-15 10:53:16,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:16,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:16,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:16,727 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:16,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:16,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:16,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:16,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:16,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:16,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:16,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:16,752 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-02-15 10:53:16,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:16,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:16,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,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, 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-02-15 10:53:16,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:16,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:16,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:16,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:16,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:16,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:16,845 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:16,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:16,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:16,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:16,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:16,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:16,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:53:16,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:16,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:16,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:16,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-02-15 10:53:16,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:17,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:17,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:17,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:17,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:17,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:17,021 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-02-15 10:53:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:17,357 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-02-15 10:53:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:17,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:53:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:17,359 INFO L225 Difference]: With dead ends: 113 [2019-02-15 10:53:17,359 INFO L226 Difference]: Without dead ends: 112 [2019-02-15 10:53:17,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:53:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-15 10:53:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-02-15 10:53:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:53:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-02-15 10:53:17,387 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-02-15 10:53:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:17,387 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-02-15 10:53:17,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-02-15 10:53:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:17,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:17,388 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:53:17,389 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-02-15 10:53:17,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:17,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:17,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:17,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:17,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:17,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:17,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:17,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:17,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:17,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:17,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:17,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:17,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:17,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:53:17,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:17,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:17,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:17,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,561 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-02-15 10:53:17,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:17,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:17,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:53:17,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:17,679 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:17,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:17,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:17,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-02-15 10:53:17,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:17,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:17,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:17,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:17,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:17,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:17,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:17,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-02-15 10:53:17,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:18,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:18,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:18,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:18,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:18,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:53:18,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:18,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:53:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:53:18,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:18,133 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-02-15 10:53:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:18,982 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-02-15 10:53:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:18,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:53:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:18,984 INFO L225 Difference]: With dead ends: 136 [2019-02-15 10:53:18,985 INFO L226 Difference]: Without dead ends: 131 [2019-02-15 10:53:18,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:53:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-15 10:53:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-02-15 10:53:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:53:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-15 10:53:19,014 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-15 10:53:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:19,014 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-15 10:53:19,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:53:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-15 10:53:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:19,015 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:19,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:19,015 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-15 10:53:19,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:19,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:19,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:19,224 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:53:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:19,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:19,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:19,285 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:19,286 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-15 10:53:19,287 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:19,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:19,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:19,289 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:19,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:19,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:19,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:19,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:19,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:19,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:19,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:19,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,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, 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-02-15 10:53:19,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:19,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:53:19,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:53:19,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,398 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:19,454 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:19,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:19,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:19,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:19,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:53:19,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:19,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:19,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:19,653 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:19,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:53:19,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:19,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:19,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:19,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:19,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:19,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:19,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:19,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:19,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:19,783 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-02-15 10:53:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:20,281 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-02-15 10:53:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:20,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:20,283 INFO L225 Difference]: With dead ends: 106 [2019-02-15 10:53:20,283 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 10:53:20,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 10:53:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-02-15 10:53:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:53:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-15 10:53:20,304 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-15 10:53:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:20,305 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-15 10:53:20,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-15 10:53:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:20,305 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:20,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:20,305 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-02-15 10:53:20,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:20,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:20,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:20,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:20,910 WARN L181 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:53:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:20,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:20,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:20,988 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:20,988 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-02-15 10:53:20,989 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:20,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:20,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:20,992 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:53:20,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:20,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:20,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:20,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:21,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:21,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:21,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:21,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:21,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:21,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:21,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:21,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,043 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-02-15 10:53:21,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:21,126 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:21,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:21,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:21,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:21,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:53:21,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:21,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:21,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,365 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:21,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:53:21,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:21,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:21,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,465 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:21,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:21,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:53:21,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:21,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:21,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:21,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:21,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:21,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:53:21,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:21,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:21,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:21,611 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-02-15 10:53:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:22,353 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-02-15 10:53:22,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:22,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:22,355 INFO L225 Difference]: With dead ends: 131 [2019-02-15 10:53:22,355 INFO L226 Difference]: Without dead ends: 130 [2019-02-15 10:53:22,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:53:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-15 10:53:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-02-15 10:53:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:53:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-15 10:53:22,377 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-15 10:53:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:22,378 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-15 10:53:22,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-15 10:53:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:22,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:22,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:22,379 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-02-15 10:53:22,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:22,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:22,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:22,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:22,549 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-15 10:53:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:22,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:22,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:22,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:22,571 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-15 10:53:22,572 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:22,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:22,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:22,576 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:22,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:22,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:22,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:22,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:22,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:22,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53: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, 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-02-15 10:53:22,598 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-02-15 10:53:22,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-15 10:53:22,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:53:22,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:53:22,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:22,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:22,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:22,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:22,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:22,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:22,686 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-15 10:53:22,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:53:22,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:22,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:22,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:53:22,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:22,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-02-15 10:53:22,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:22,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:22,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:53:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:22,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:22,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:22,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:22,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:22,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:22,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:22,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:22,825 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-02-15 10:53:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:23,059 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-02-15 10:53:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:23,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:23,061 INFO L225 Difference]: With dead ends: 93 [2019-02-15 10:53:23,061 INFO L226 Difference]: Without dead ends: 92 [2019-02-15 10:53:23,062 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-02-15 10:53:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-15 10:53:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-02-15 10:53:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:53:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-15 10:53:23,086 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-15 10:53:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:23,087 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-15 10:53:23,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-15 10:53:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:23,087 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:23,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:23,088 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-02-15 10:53:23,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:23,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:23,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:23,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:23,360 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:23,360 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-02-15 10:53:23,361 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:23,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:23,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:23,365 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:53:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:23,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:23,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:23,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:23,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:23,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:23,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:23,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:53:23,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:53:23,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:23,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:23,419 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,539 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:23,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:23,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:23,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:23,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,883 INFO L303 Elim1Store]: Index analysis took 219 ms [2019-02-15 10:53:23,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:53:23,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,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-02-15 10:53:23,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:23,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,966 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:23,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:23,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:53:23,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:24,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-02-15 10:53:24,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:24,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:24,058 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:24,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-02-15 10:53:24,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:24,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:24,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:53:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:24,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:24,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:24,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:53:24,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:24,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:24,227 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-02-15 10:53:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:25,172 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-02-15 10:53:25,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:25,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:25,173 INFO L225 Difference]: With dead ends: 117 [2019-02-15 10:53:25,173 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 10:53:25,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:53:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 10:53:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-02-15 10:53:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 10:53:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-02-15 10:53:25,201 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-02-15 10:53:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:25,202 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-02-15 10:53:25,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-02-15 10:53:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:25,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:25,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:25,202 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-15 10:53:25,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:25,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:25,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:25,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-02-15 10:53:25,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:25,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:25,361 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:25,361 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-15 10:53:25,363 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:25,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:25,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:25,365 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:25,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:25,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:25,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:25,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:25,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:25,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:25,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:25,387 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-02-15 10:53:25,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:25,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:25,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:25,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,437 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:25,485 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:25,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:53:25,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:25,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:25,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:53:25,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:25,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:25,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:25,644 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:25,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:53:25,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:25,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:25,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:25,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:25,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:25,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:25,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:25,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:25,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:25,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:25,754 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-02-15 10:53:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:26,209 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-02-15 10:53:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:26,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:26,211 INFO L225 Difference]: With dead ends: 99 [2019-02-15 10:53:26,212 INFO L226 Difference]: Without dead ends: 98 [2019-02-15 10:53:26,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-15 10:53:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-02-15 10:53:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:53:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-02-15 10:53:26,255 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-02-15 10:53:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:26,255 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-02-15 10:53:26,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-02-15 10:53:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:26,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:26,256 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:53:26,256 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-02-15 10:53:26,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:26,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:26,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:26,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:26,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:26,576 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-02-15 10:53:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:26,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:26,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:26,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:26,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:26,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:26,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:26,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:53:26,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:53:26,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:53:26,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:26,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:26,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:26,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:26,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:53:26,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:26,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53: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, 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-02-15 10:53:26,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:26,716 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:26,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:26,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:26,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:26,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:26,771 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:26,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:26,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:26,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:26,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:26,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:26,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:26,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:26,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:26,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:26,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:53:26,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:27,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:27,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:27,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:27,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-02-15 10:53:27,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:27,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:27,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:27,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:27,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:27,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:53:27,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:27,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:53:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:53:27,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:27,235 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-02-15 10:53:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:27,952 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-02-15 10:53:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:27,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:53:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:27,954 INFO L225 Difference]: With dead ends: 132 [2019-02-15 10:53:27,954 INFO L226 Difference]: Without dead ends: 130 [2019-02-15 10:53:27,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:53:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-15 10:53:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-02-15 10:53:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 10:53:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-02-15 10:53:27,981 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-02-15 10:53:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:27,982 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-02-15 10:53:27,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:53:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-02-15 10:53:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:27,982 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:27,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:27,983 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-02-15 10:53:27,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:27,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:27,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:27,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:28,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:28,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:28,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:28,060 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-15 10:53:28,062 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:28,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:28,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:28,064 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:28,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:28,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:28,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:28,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:28,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:28,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:28,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:28,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,151 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-02-15 10:53:28,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:28,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:28,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,169 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-02-15 10:53:28,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:28,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:28,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:28,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:28,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:28,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:28,252 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:28,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:28,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:28,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-02-15 10:53:28,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:28,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:28,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:28,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:28,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:28,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:28,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:28,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:28,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:28,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:28,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:28,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:28,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:28,518 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-02-15 10:53:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:28,926 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-02-15 10:53:28,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:28,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:28,927 INFO L225 Difference]: With dead ends: 87 [2019-02-15 10:53:28,927 INFO L226 Difference]: Without dead ends: 86 [2019-02-15 10:53:28,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-15 10:53:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-02-15 10:53:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:53:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-02-15 10:53:28,960 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-02-15 10:53:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:28,960 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-02-15 10:53:28,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-02-15 10:53:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:28,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:28,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:28,961 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-02-15 10:53:28,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:28,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:28,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:29,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:29,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:29,088 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:29,088 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-02-15 10:53:29,089 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:29,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:29,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:29,091 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:29,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:29,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:29,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:29,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:29,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:29,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:29,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:29,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,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-02-15 10:53:29,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:29,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:29,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,143 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-02-15 10:53:29,144 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,172 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:29,226 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:29,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:29,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:29,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:29,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:29,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:29,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:29,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,415 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:29,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:29,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:53:29,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:29,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:29,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:29,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:29,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:53:29,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:29,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:29,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:29,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:29,532 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-02-15 10:53:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:29,983 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-02-15 10:53:29,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:29,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:29,986 INFO L225 Difference]: With dead ends: 106 [2019-02-15 10:53:29,986 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 10:53:29,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 10:53:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-02-15 10:53:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 10:53:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-02-15 10:53:30,016 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-02-15 10:53:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:30,016 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-02-15 10:53:30,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-02-15 10:53:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:30,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:30,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:30,017 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-15 10:53:30,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:30,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:30,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:30,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:30,273 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:53:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:30,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:30,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:30,351 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:30,351 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-15 10:53:30,352 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:30,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:30,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:30,354 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:30,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:30,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:30,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:30,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:30,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:30,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:53:30,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:53:30,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:53:30,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,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, 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-02-15 10:53:30,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:30,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:30,551 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:30,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,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 36 treesize of output 66 [2019-02-15 10:53:30,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:30,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:30,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:30,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,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-02-15 10:53:30,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:30,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:30,741 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:30,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-15 10:53:30,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:30,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:30,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:30,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:30,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:30,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:30,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:30,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:30,875 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-02-15 10:53:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:31,394 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-02-15 10:53:31,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:31,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:31,396 INFO L225 Difference]: With dead ends: 102 [2019-02-15 10:53:31,396 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 10:53:31,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 10:53:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-02-15 10:53:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 10:53:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-02-15 10:53:31,426 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-02-15 10:53:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:31,426 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-02-15 10:53:31,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-02-15 10:53:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:31,427 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:31,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:31,427 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:31,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:31,427 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-02-15 10:53:31,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:31,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:31,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:31,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:31,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:31,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:31,523 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-15 10:53:31,526 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:31,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:31,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:31,528 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:31,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:31,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:31,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:31,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:31,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:31,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:31,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:31,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:31,561 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-02-15 10:53:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:31,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:31,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:31,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:31,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:31,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:31,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:31,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:31,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:31,659 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:31,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:53:31,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:31,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:31,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:31,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:31,849 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:31,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:53:31,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:31,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:31,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:53:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:31,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:31,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:31,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:31,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:31,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:31,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:31,940 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-02-15 10:53:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:32,230 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-02-15 10:53:32,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:32,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:32,232 INFO L225 Difference]: With dead ends: 94 [2019-02-15 10:53:32,232 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 10:53:32,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 10:53:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-02-15 10:53:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 10:53:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-02-15 10:53:32,270 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-02-15 10:53:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:32,270 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-02-15 10:53:32,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-02-15 10:53:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:32,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:32,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:32,271 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:32,271 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-02-15 10:53:32,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:32,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:32,786 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-15 10:53:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:32,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:32,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:32,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:32,915 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-02-15 10:53:32,918 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:32,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:32,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:32,920 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:32,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:32,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:32,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:32,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:32,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:32,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:32,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:32,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:33,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:33,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:33,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,051 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-02-15 10:53:33,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,072 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:33,120 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:33,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:53:33,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:33,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:33,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,217 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:33,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 33 treesize of output 60 [2019-02-15 10:53:33,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:33,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:53:33,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:33,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-02-15 10:53:33,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:33,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:33,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:53:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:33,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:33,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:33,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:33,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:33,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:33,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:33,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:33,402 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-02-15 10:53:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:33,880 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-02-15 10:53:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:33,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:33,882 INFO L225 Difference]: With dead ends: 116 [2019-02-15 10:53:33,882 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 10:53:33,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 10:53:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-02-15 10:53:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-15 10:53:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-02-15 10:53:33,919 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-02-15 10:53:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:33,919 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-02-15 10:53:33,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-02-15 10:53:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:33,920 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:33,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:33,920 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-02-15 10:53:33,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:33,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:33,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:34,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:34,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:34,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:34,064 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-02-15 10:53:34,064 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:34,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:34,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:34,067 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:53:34,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:34,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:34,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:34,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:34,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:34,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:34,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:34,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:34,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,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, 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-02-15 10:53:34,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:53:34,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:34,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,128 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-02-15 10:53:34,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,162 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:34,217 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:34,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:34,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:34,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:34,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:34,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:34,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:34,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,474 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:34,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-15 10:53:34,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:34,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:34,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,621 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:34,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:34,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:53:34,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:34,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:34,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:34,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:34,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:53:34,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:34,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:34,795 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-02-15 10:53:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:35,763 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-02-15 10:53:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:35,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:35,765 INFO L225 Difference]: With dead ends: 140 [2019-02-15 10:53:35,765 INFO L226 Difference]: Without dead ends: 139 [2019-02-15 10:53:35,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:53:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-15 10:53:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-02-15 10:53:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-15 10:53:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-02-15 10:53:35,806 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-02-15 10:53:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:35,806 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-02-15 10:53:35,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-02-15 10:53:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:35,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:35,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:35,807 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-02-15 10:53:35,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:35,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:35,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:35,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:35,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:35,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:35,905 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-15 10:53:35,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:35,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:35,908 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:35,908 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:35,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:35,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:35,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:35,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:35,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:35,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:35,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:35,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, 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-02-15 10:53:35,935 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-02-15 10:53:35,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:35,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:53:35,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:35,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:35,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:53:35,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:35,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:35,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:35,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:36,023 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-15 10:53:36,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:53:36,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:36,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:53:36,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 10:53:36,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:36,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:53:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:36,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:36,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:36,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:53:36,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:36,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:36,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:36,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:53:36,153 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-02-15 10:53:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:36,432 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-02-15 10:53:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:36,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:36,434 INFO L225 Difference]: With dead ends: 112 [2019-02-15 10:53:36,434 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 10:53:36,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 10:53:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-02-15 10:53:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-15 10:53:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-02-15 10:53:36,470 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-02-15 10:53:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:36,470 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-02-15 10:53:36,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-02-15 10:53:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:36,471 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:36,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:36,471 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-02-15 10:53:36,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:36,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:36,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:36,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:36,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:36,616 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:53:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:36,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:36,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:36,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:36,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:36,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:36,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:36,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:36,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:53:36,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:36,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:36,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:36,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:53:36,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:36,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:53:36,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:36,759 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,786 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:36,840 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:36,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:36,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:36,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:36,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:36,965 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:36,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:36,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:37,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-02-15 10:53:37,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:37,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:53:37,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:37,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:37,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:37,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,177 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:37,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:37,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:53:37,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:37,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:37,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:37,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:37,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:37,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:53:37,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:37,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:37,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:37,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:37,343 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-02-15 10:53:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:38,276 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-02-15 10:53:38,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:38,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:38,278 INFO L225 Difference]: With dead ends: 137 [2019-02-15 10:53:38,278 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 10:53:38,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:53:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 10:53:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-02-15 10:53:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:53:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-02-15 10:53:38,316 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-02-15 10:53:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:38,316 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-02-15 10:53:38,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-02-15 10:53:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:38,317 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:38,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:38,317 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:38,318 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-15 10:53:38,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:38,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:38,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:38,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:38,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:38,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:38,445 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:38,445 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-15 10:53:38,446 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:38,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:38,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:38,449 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:38,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:38,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:38,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:38,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:38,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:38,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:38,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:38,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:38,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:53:38,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:38,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:53:38,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:38,585 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:38,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:38,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:38,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:38,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,745 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:38,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:38,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:38,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:38,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:38,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:38,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:38,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:38,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:38,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:39,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:39,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:53:39,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:39,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:39,026 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-02-15 10:53:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:39,509 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-15 10:53:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:39,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:39,511 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:53:39,511 INFO L226 Difference]: Without dead ends: 123 [2019-02-15 10:53:39,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-15 10:53:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-02-15 10:53:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 10:53:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-02-15 10:53:39,552 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-02-15 10:53:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:39,552 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-02-15 10:53:39,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-02-15 10:53:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:39,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:39,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:39,553 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-15 10:53:39,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:39,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:39,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:39,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-02-15 10:53:39,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:39,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:39,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:39,729 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-15 10:53:39,731 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:39,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:39,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:39,734 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:39,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:39,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:39,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:39,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:39,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:39,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:39,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:53:39,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:53:39,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:53:39,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:39,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,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, 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-02-15 10:53:39,776 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:39,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:39,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:39,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:39,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:39,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:39,861 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:39,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:39,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:39,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:39,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:39,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:39,975 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53: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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:39,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:40,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:40,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:40,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,062 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:40,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:40,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:40,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:40,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:40,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:40,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:40,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:53:40,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:40,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:53:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:53:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:40,185 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-02-15 10:53:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:40,700 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-02-15 10:53:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:40,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:53:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:40,702 INFO L225 Difference]: With dead ends: 119 [2019-02-15 10:53:40,702 INFO L226 Difference]: Without dead ends: 118 [2019-02-15 10:53:40,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-15 10:53:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-02-15 10:53:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 10:53:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-02-15 10:53:40,750 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-02-15 10:53:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:40,750 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-02-15 10:53:40,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:53:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-02-15 10:53:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:40,751 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:40,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:40,751 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:40,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-02-15 10:53:40,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:40,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:40,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:40,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:40,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:40,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:40,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:40,910 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-02-15 10:53:40,910 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:40,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:40,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:40,912 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:53:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:40,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:40,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:40,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:40,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:40,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:40,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:40,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:40,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:53:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:40,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:40,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:40,964 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-02-15 10:53:40,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:40,995 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:41,050 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:41,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:41,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:41,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:41,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:41,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,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-02-15 10:53:41,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:41,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,253 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:41,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:53:41,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:41,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:41,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:41,355 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:41,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:53:41,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:41,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:41,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:41,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:41,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:41,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:53:41,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:41,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:41,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:41,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:41,487 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-02-15 10:53:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:42,469 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-02-15 10:53:42,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:42,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:42,472 INFO L225 Difference]: With dead ends: 149 [2019-02-15 10:53:42,472 INFO L226 Difference]: Without dead ends: 148 [2019-02-15 10:53:42,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:53:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-02-15 10:53:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-02-15 10:53:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 10:53:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-02-15 10:53:42,534 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-02-15 10:53:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:42,535 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-02-15 10:53:42,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-02-15 10:53:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:42,536 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:42,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:42,536 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:42,536 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-02-15 10:53:42,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:42,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:42,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:42,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:42,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:42,641 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:42,641 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-15 10:53:42,641 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:42,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:42,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:42,644 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:42,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:42,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:42,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:42,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:42,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:42,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:42,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:42,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:53:42,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:42,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:42,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:42,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:42,782 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:42,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:42,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:42,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:42,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:53:42,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:42,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:42,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:42,942 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:42,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:53:42,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:42,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:42,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:42,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:43,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:43,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:53:43,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:43,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:53:43,049 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-02-15 10:53:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:43,559 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-02-15 10:53:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:43,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:43,561 INFO L225 Difference]: With dead ends: 139 [2019-02-15 10:53:43,561 INFO L226 Difference]: Without dead ends: 138 [2019-02-15 10:53:43,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-15 10:53:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-02-15 10:53:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 10:53:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-02-15 10:53:43,614 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-02-15 10:53:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:43,614 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-02-15 10:53:43,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-02-15 10:53:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:43,615 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:43,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:43,615 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-02-15 10:53:43,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:43,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:43,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:43,785 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:53:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:43,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:43,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:43,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:43,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:43,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:43,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:43,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:43,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:43,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:53:43,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:43,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:43,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:53:43,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,938 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-02-15 10:53:43,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:43,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:43,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:43,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:43,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,010 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:44,081 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:44,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:44,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:44,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:44,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,201 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:44,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:44,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:44,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:44,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,285 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:44,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:44,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:44,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:44,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:44,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:44,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:44,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:44,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:44,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:44,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:44,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:53:44,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:44,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:44,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:44,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:44,513 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-02-15 10:53:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:45,312 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-02-15 10:53:45,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:45,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:45,314 INFO L225 Difference]: With dead ends: 164 [2019-02-15 10:53:45,314 INFO L226 Difference]: Without dead ends: 163 [2019-02-15 10:53:45,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:53:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-15 10:53:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-02-15 10:53:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 10:53:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-02-15 10:53:45,370 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-02-15 10:53:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:45,370 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-02-15 10:53:45,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-02-15 10:53:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:45,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:45,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:45,371 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-15 10:53:45,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:45,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:45,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:45,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:45,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:45,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:45,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:45,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:45,475 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-02-15 10:53:45,476 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:45,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:45,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:45,478 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:45,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:45,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:45,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:45,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:45,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:45,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:45,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:45,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:45,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:53:45,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:45,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:45,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,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, 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-02-15 10:53:45,556 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:45,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:45,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:45,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:45,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:45,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:45,640 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:45,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:45,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:45,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:45,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:45,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:45,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:45,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:45,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:45,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:45,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:45,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:45,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:45,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:45,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:45,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:45,860 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-02-15 10:53:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:46,253 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-02-15 10:53:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:46,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:46,255 INFO L225 Difference]: With dead ends: 122 [2019-02-15 10:53:46,255 INFO L226 Difference]: Without dead ends: 121 [2019-02-15 10:53:46,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-15 10:53:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-02-15 10:53:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-15 10:53:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-02-15 10:53:46,310 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-02-15 10:53:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:46,310 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-02-15 10:53:46,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-02-15 10:53:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:46,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:46,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:46,311 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-02-15 10:53:46,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:46,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:46,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:46,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:46,588 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-15 10:53:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:46,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:46,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:46,634 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:46,634 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-02-15 10:53:46,635 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:46,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:46,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:46,637 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:53:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:46,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:46,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:46,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:46,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:46,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:46,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:46,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:46,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:46,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:46,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,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, 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-02-15 10:53:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,677 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-02-15 10:53:46,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:46,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:46,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:46,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:46,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:46,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:46,763 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:46,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:46,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:46,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:46,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:46,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,874 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:46,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:46,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:46,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:46,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:46,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:46,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:53:46,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:47,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:47,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:47,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:47,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:47,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:53:47,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:47,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:47,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:47,077 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-02-15 10:53:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:47,659 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-02-15 10:53:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:47,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:47,661 INFO L225 Difference]: With dead ends: 154 [2019-02-15 10:53:47,662 INFO L226 Difference]: Without dead ends: 153 [2019-02-15 10:53:47,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-15 10:53:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-02-15 10:53:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-15 10:53:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-02-15 10:53:47,731 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-02-15 10:53:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:47,731 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-02-15 10:53:47,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-02-15 10:53:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:47,732 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:47,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:47,732 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-02-15 10:53:47,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:47,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:47,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:47,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:47,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:47,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:47,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:47,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:47,871 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-15 10:53:47,872 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:47,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:47,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:47,875 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:47,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:47,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:47,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:47,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:47,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:47,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:47,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:47,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:47,896 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-02-15 10:53:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:47,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:47,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:47,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:47,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:47,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:47,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:47,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:53:47,920 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:47,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:47,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:47,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:47,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:47,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:47,989 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:48,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:48,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:48,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:48,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,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 67 [2019-02-15 10:53:48,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:48,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:48,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:48,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-02-15 10:53:48,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:48,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:48,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:48,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:48,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:48,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:48,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:48,170 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-02-15 10:53:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:48,490 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-02-15 10:53:48,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:53:48,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:48,492 INFO L225 Difference]: With dead ends: 130 [2019-02-15 10:53:48,492 INFO L226 Difference]: Without dead ends: 129 [2019-02-15 10:53:48,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-15 10:53:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-02-15 10:53:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-15 10:53:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-02-15 10:53:48,561 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-02-15 10:53:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:48,561 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-02-15 10:53:48,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-02-15 10:53:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:48,562 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:48,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:48,562 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-02-15 10:53:48,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:48,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:48,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:48,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:48,718 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-15 10:53:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:48,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:48,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:48,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:48,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:48,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:48,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:48,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:48,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:53:48,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:48,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:48,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:48,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,783 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-02-15 10:53:48,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:53:48,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:53:48,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,804 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-02-15 10:53:48,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:48,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:48,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:48,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:48,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:48,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:48,909 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:48,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:48,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:48,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:49,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:49,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:49,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:49,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:49,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:49,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:49,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:49,215 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:49,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:53:49,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:49,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:49,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:49,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-02-15 10:53:49,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:49,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:49,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:53:49,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:49,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:53:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:53:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:49,349 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-02-15 10:53:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:49,875 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-02-15 10:53:49,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:49,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:53:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:49,878 INFO L225 Difference]: With dead ends: 160 [2019-02-15 10:53:49,878 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 10:53:49,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:53:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 10:53:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-02-15 10:53:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-15 10:53:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-02-15 10:53:49,944 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-02-15 10:53:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:49,944 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-02-15 10:53:49,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:53:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-02-15 10:53:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:49,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:49,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:49,946 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:49,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-02-15 10:53:49,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:49,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:49,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:49,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:50,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:50,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:50,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:50,035 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-02-15 10:53:50,037 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:50,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:50,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:50,040 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:53:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:50,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:50,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:50,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:50,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:50,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:50,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:50,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:50,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:50,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:50,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,117 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-02-15 10:53:50,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:50,182 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:50,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:50,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:50,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:50,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:50,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:53:50,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:53:50,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:53:50,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:53:50,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:53:50,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:53:50,286 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-02-15 10:53:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:50,390 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-02-15 10:53:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:53:50,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 10:53:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:50,391 INFO L225 Difference]: With dead ends: 121 [2019-02-15 10:53:50,392 INFO L226 Difference]: Without dead ends: 117 [2019-02-15 10:53:50,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:53:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-15 10:53:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-02-15 10:53:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-15 10:53:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-02-15 10:53:50,456 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-02-15 10:53:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:50,456 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-02-15 10:53:50,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:53:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-02-15 10:53:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:50,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:50,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:50,457 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-02-15 10:53:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:50,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:50,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:50,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:50,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:50,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:50,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:50,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:50,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:50,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:50,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:50,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:53:50,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:50,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:50,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:50,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,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, 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-02-15 10:53:50,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:50,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:53:50,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,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, 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-02-15 10:53:50,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,695 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:50,725 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:50,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:53:50,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:50,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:50,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:53:50,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:50,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:50,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:50,926 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:50,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-15 10:53:50,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:50,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:51,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:51,140 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:51,140 INFO L303 Elim1Store]: Index analysis took 136 ms [2019-02-15 10:53:51,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-02-15 10:53:51,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:51,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:51,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:51,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:51,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:51,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:53:51,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:51,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:51,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:51,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:51,468 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-02-15 10:53:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:52,394 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-02-15 10:53:52,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:52,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:52,397 INFO L225 Difference]: With dead ends: 186 [2019-02-15 10:53:52,397 INFO L226 Difference]: Without dead ends: 184 [2019-02-15 10:53:52,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:53:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-15 10:53:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-02-15 10:53:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 10:53:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-02-15 10:53:52,489 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-02-15 10:53:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:52,490 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-02-15 10:53:52,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-02-15 10:53:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:52,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:52,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:52,490 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:52,491 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-02-15 10:53:52,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:52,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:52,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:52,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:52,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:52,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:53:52,625 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-02-15 10:53:52,626 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:52,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:52,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:52,629 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:53:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:52,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:52,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:52,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:52,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:52,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:52,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:52,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:53:52,650 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-02-15 10:53:52,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:52,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,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, 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-02-15 10:53:52,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:52,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:52,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:52,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:52,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:52,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:52,754 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:52,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:52,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:52,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:52,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:52,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:52,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:53:52,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:52,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:52,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:52,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:52,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:52,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:53:52,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:52,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:53:52,923 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-02-15 10:53:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:53,275 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-02-15 10:53:53,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:53:53,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:53,278 INFO L225 Difference]: With dead ends: 161 [2019-02-15 10:53:53,278 INFO L226 Difference]: Without dead ends: 160 [2019-02-15 10:53:53,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:53:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-15 10:53:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-02-15 10:53:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 10:53:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-02-15 10:53:53,393 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-02-15 10:53:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:53,394 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-02-15 10:53:53,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-02-15 10:53:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:53,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:53,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:53,395 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:53,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-02-15 10:53:53,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:53,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:53,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:53,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:53,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:53,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:53,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:53,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53: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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:53,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:53,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:53:53,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:53,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:53,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:53,554 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-02-15 10:53:53,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:53,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:53:53,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:53:53,585 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,600 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:53,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-15 10:53:53,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:53:53,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:53,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:53:53,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:53,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:53,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:53,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:53:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:53,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:53,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:53,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:53:53,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:53:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:53:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:53:53,784 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-02-15 10:53:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:54,188 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-02-15 10:53:54,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:53:54,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:53:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:54,190 INFO L225 Difference]: With dead ends: 172 [2019-02-15 10:53:54,190 INFO L226 Difference]: Without dead ends: 170 [2019-02-15 10:53:54,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:53:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-15 10:53:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-02-15 10:53:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-15 10:53:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-02-15 10:53:54,272 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-02-15 10:53:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:54,272 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-02-15 10:53:54,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:53:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-02-15 10:53:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:54,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:54,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:54,273 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-02-15 10:53:54,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:54,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:54,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:54,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:54,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:54,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:54,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:54,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:54,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:54,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:53:54,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:53:54,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:53:54,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:54,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:54,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:53:54,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,472 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-02-15 10:53:54,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:53:54,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:53:54,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:54,571 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:54,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,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-02-15 10:53:54,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:54,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:54,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,694 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:54,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:53:54,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:54,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:54,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:53:54,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:54,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:54,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,860 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:54,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:54,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:53:54,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:54,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:54,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:55,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:53:55,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:55,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:55,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:53:55,018 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-02-15 10:53:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:55,807 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-02-15 10:53:55,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:55,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:53:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:55,810 INFO L225 Difference]: With dead ends: 209 [2019-02-15 10:53:55,810 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 10:53:55,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:53:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 10:53:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-02-15 10:53:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-15 10:53:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-02-15 10:53:55,894 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-02-15 10:53:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:55,894 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-02-15 10:53:55,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:53:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-02-15 10:53:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:53:55,895 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:55,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:53:55,895 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-02-15 10:53:55,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:55,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:55,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:55,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-02-15 10:53:55,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:55,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:55,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:55,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:55,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:55,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:56,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:56,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:56,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:53:56,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:56,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:56,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:56,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:53:56,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:53:56,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:53:56,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,047 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-02-15 10:53:56,048 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:56,114 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:53:56,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:53:56,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:56,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:56,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:53:56,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:56,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:53:56,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:56,295 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:56,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-02-15 10:53:56,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:56,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:56,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:53:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:56,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:56,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:56,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:53:56,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:56,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:53:56,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:53:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:53:56,449 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-02-15 10:53:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:56,953 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-02-15 10:53:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:53:56,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:53:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:56,955 INFO L225 Difference]: With dead ends: 180 [2019-02-15 10:53:56,956 INFO L226 Difference]: Without dead ends: 173 [2019-02-15 10:53:56,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:53:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-15 10:53:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-02-15 10:53:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-15 10:53:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-02-15 10:53:57,044 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-02-15 10:53:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:57,044 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-02-15 10:53:57,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:53:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-02-15 10:53:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:53:57,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:57,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:53:57,045 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-02-15 10:53:57,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:57,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:57,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:57,738 WARN L181 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:53:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:53:57,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:57,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:57,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:53:57,817 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-15 10:53:57,818 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:53:57,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:53:57,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:53:57,820 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:53:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:57,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:53:57,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:57,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:57,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:57,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:57,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:57,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:53:57,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,845 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-02-15 10:53:57,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:53:57,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:53:57,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,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, 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-02-15 10:53:57,864 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:57,890 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:57,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:57,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:57,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:57,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:57,944 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:53:57,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:57,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:53:57,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:58,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:58,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:53:58,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:53:58,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:58,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:58,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:58,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,139 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:58,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:53:58,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:58,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:58,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:53:58,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,226 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:53:58,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:53:58,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:53:58,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:58,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:53:58,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:53:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:58,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:59,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:59,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:53:59,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:59,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:53:59,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:53:59,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:53:59,040 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-02-15 10:53:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:59,964 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-02-15 10:53:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:53:59,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:53:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:59,966 INFO L225 Difference]: With dead ends: 189 [2019-02-15 10:53:59,967 INFO L226 Difference]: Without dead ends: 188 [2019-02-15 10:53:59,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:53:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-02-15 10:54:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-02-15 10:54:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 10:54:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-02-15 10:54:00,062 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-02-15 10:54:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:00,062 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-02-15 10:54:00,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:54:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-02-15 10:54:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:00,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:00,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:00,063 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-15 10:54:00,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:00,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:00,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:00,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:00,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:00,264 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:00,265 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-15 10:54:00,265 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:00,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:00,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:00,268 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:54:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:00,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:00,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:00,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:00,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:00,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:00,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:00,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:00,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,290 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-02-15 10:54:00,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:00,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:54:00,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,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, 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-02-15 10:54:00,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,405 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:00,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:00,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:00,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:00,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:54:00,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:00,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:00,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,610 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:00,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:54:00,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:00,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:00,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:00,710 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:00,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:54:00,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:00,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:00,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:00,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:00,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:00,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:54:00,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:00,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:54:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:54:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:00,862 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-02-15 10:54:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:01,654 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-02-15 10:54:01,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:54:01,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:54:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:01,657 INFO L225 Difference]: With dead ends: 169 [2019-02-15 10:54:01,657 INFO L226 Difference]: Without dead ends: 168 [2019-02-15 10:54:01,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:54:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-02-15 10:54:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-02-15 10:54:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-15 10:54:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-02-15 10:54:01,756 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-02-15 10:54:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:01,756 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-02-15 10:54:01,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:54:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-02-15 10:54:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:01,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:01,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:01,757 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:01,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:01,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-15 10:54:01,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:01,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:01,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:01,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:01,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:01,847 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:01,848 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-15 10:54:01,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:01,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:01,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:01,850 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:01,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:01,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:01,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:01,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:01,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:01,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:01,875 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-02-15 10:54:01,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:54:01,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:54:01,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:01,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, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-15 10:54:01,905 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:01,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:01,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:01,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:01,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:01,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:01,981 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-02-15 10:54:02,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-15 10:54:02,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-15 10:54:02,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:02,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:02,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-15 10:54:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:02,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:02,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:02,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:54:02,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:02,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:54:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:54:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:54:02,089 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-02-15 10:54:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:02,374 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-02-15 10:54:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:54:02,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:54:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:02,377 INFO L225 Difference]: With dead ends: 159 [2019-02-15 10:54:02,377 INFO L226 Difference]: Without dead ends: 158 [2019-02-15 10:54:02,377 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-02-15 10:54:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-15 10:54:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-02-15 10:54:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-15 10:54:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-02-15 10:54:02,467 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-02-15 10:54:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:02,467 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-02-15 10:54:02,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:54:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-02-15 10:54:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:02,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:02,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:02,468 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:02,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-02-15 10:54:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:02,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:02,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:02,660 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-02-15 10:54:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:02,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:02,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:02,776 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:02,776 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-02-15 10:54:02,777 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:02,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:02,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:02,780 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 10:54:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:02,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:02,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:02,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:02,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:02,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:02,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:02,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:54:02,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:02,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:02,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,852 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-02-15 10:54:02,853 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:02,938 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:02,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:02,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:02,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:03,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:03,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:03,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:54:03,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:03,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:03,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:03,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,139 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:03,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:54:03,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:03,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:03,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:03,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,237 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:03,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-02-15 10:54:03,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:03,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:03,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:03,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:03,346 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:03,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-02-15 10:54:03,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:03,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:03,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:03,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:03,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:03,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 10:54:03,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:03,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:54:03,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:54:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:54:03,502 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-02-15 10:54:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:04,791 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-02-15 10:54:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:54:04,792 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 10:54:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:04,794 INFO L225 Difference]: With dead ends: 199 [2019-02-15 10:54:04,794 INFO L226 Difference]: Without dead ends: 198 [2019-02-15 10:54:04,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:54:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-15 10:54:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-02-15 10:54:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-15 10:54:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-02-15 10:54:04,885 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-02-15 10:54:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:04,885 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-02-15 10:54:04,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:54:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-02-15 10:54:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:04,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:04,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:04,886 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-02-15 10:54:04,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:04,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:04,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:05,055 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-15 10:54:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:05,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:05,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:05,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:05,131 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-02-15 10:54:05,133 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:05,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:05,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:05,135 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:54:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:05,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:05,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:05,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:05,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:05,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:05,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:05,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:05,157 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-02-15 10:54:05,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:05,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:54:05,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:05,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:05,256 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:54:05,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:54:05,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:05,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:05,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:54:05,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:05,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:54:05,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,417 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:05,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:54:05,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:05,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:54:05,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:05,482 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:05,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:54:05,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:05,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:05,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:54:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:05,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:05,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:05,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:54:05,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:05,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:54:05,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:54:05,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:54:05,611 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-02-15 10:54:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:06,294 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-02-15 10:54:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:54:06,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:54:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:06,297 INFO L225 Difference]: With dead ends: 181 [2019-02-15 10:54:06,297 INFO L226 Difference]: Without dead ends: 180 [2019-02-15 10:54:06,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:54:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-15 10:54:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-02-15 10:54:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-15 10:54:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-02-15 10:54:06,394 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-02-15 10:54:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:06,395 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-02-15 10:54:06,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:54:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-02-15 10:54:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:06,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:06,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:06,395 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-02-15 10:54:06,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:06,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:06,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:06,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:06,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:06,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:06,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:06,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:06,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:06,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:06,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:06,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:06,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:06,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:54:06,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:06,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:06,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:06,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:54:06,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:54:06,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:54:06,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:54:06,669 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:06,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:06,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:06,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:06,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:54:06,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:06,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:06,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:06,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:06,978 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:06,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:54:06,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:07,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:07,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:07,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,072 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:07,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:54:07,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:07,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:07,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,161 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:07,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:07,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:54:07,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:07,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:07,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:07,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:07,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:07,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 10:54:07,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:07,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:54:07,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:54:07,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:54:07,348 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-02-15 10:54:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:08,637 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-02-15 10:54:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:54:08,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 10:54:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:08,639 INFO L225 Difference]: With dead ends: 200 [2019-02-15 10:54:08,640 INFO L226 Difference]: Without dead ends: 199 [2019-02-15 10:54:08,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:54:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-15 10:54:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-02-15 10:54:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-15 10:54:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-02-15 10:54:08,732 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-02-15 10:54:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:08,732 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-02-15 10:54:08,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:54:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-02-15 10:54:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:08,733 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:08,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:08,733 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-02-15 10:54:08,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:08,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:08,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:08,990 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:54:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:09,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:09,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:09,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:09,061 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-15 10:54:09,062 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:09,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:09,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:09,064 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:54:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:09,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:09,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:09,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:09,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:09,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:09,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:09,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,099 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-02-15 10:54:09,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:09,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,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, 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-02-15 10:54:09,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,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, 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-02-15 10:54:09,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:09,213 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:09,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:09,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:09,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:09,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:54:09,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:09,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:09,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,497 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:09,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:09,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:54:09,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:09,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:09,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:09,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:09,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:09,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:54:09,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:09,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:09,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:09,631 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-02-15 10:54:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:10,182 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-02-15 10:54:10,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:54:10,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:10,185 INFO L225 Difference]: With dead ends: 160 [2019-02-15 10:54:10,185 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 10:54:10,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:54:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 10:54:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-02-15 10:54:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-15 10:54:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-02-15 10:54:10,287 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-02-15 10:54:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:10,287 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-02-15 10:54:10,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-02-15 10:54:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:10,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:10,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:10,288 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-02-15 10:54:10,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:10,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:10,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:10,600 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:54:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:10,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:10,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:10,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:10,655 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-15 10:54:10,656 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:10,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:10,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:10,659 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:54:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:10,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:10,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:10,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:10,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:10,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:10,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:10,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 18 treesize of output 21 [2019-02-15 10:54:10,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,683 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-02-15 10:54:10,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,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, 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-02-15 10:54:10,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,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, 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-02-15 10:54:10,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,710 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-02-15 10:54:10,710 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:10,737 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:10,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:10,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:10,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:10,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:10,793 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:10,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:10,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:10,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:10,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:10,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:54:10,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:10,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:10,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:10,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:10,995 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:10,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-15 10:54:10,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:11,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:11,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:11,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,085 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:11,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:11,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:54:11,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:11,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:11,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:11,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:11,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:11,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:54:11,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:11,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:54:11,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:54:11,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:11,229 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-02-15 10:54:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:12,038 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-02-15 10:54:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:54:12,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:54:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:12,041 INFO L225 Difference]: With dead ends: 197 [2019-02-15 10:54:12,041 INFO L226 Difference]: Without dead ends: 196 [2019-02-15 10:54:12,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:54:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-02-15 10:54:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-02-15 10:54:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-02-15 10:54:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-02-15 10:54:12,148 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-02-15 10:54:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:12,148 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-02-15 10:54:12,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:54:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-02-15 10:54:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:12,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:12,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:12,149 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:12,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-02-15 10:54:12,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:12,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:12,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:12,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:12,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:12,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:12,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:12,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:12,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:12,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:12,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:12,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:12,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:12,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:12,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:54:12,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:54:12,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:54:12,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,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, 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-02-15 10:54:12,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,399 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:12,456 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:12,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:12,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:12,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:12,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,651 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:12,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 10:54:12,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:12,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:12,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-15 10:54:12,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:12,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:12,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:12,835 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:12,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, 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-02-15 10:54:12,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:12,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:12,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:12,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:12,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:12,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:54:12,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:12,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:54:12,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:54:12,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:54:12,992 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-02-15 10:54:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:13,861 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-02-15 10:54:13,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:54:13,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:54:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:13,864 INFO L225 Difference]: With dead ends: 195 [2019-02-15 10:54:13,864 INFO L226 Difference]: Without dead ends: 189 [2019-02-15 10:54:13,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:54:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-15 10:54:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-02-15 10:54:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-15 10:54:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-02-15 10:54:13,999 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-02-15 10:54:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:13,999 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-02-15 10:54:13,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:54:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-02-15 10:54:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:14,000 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:14,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:14,000 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-02-15 10:54:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:14,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:14,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:14,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:14,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:14,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:14,135 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-15 10:54:14,137 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:14,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:14,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:14,140 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:54:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:14,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:14,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:14,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:14,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:14,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:14,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:14,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:14,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:54:14,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:14,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:54:14,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,200 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-02-15 10:54:14,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:14,267 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:54:14,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:54:14,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:14,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:14,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,359 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:14,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:54:14,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:14,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:54:14,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:14,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 10:54:14,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:14,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:14,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:54:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:14,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:14,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:14,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:54:14,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:14,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:14,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:14,586 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-02-15 10:54:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:15,163 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-02-15 10:54:15,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:54:15,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:15,165 INFO L225 Difference]: With dead ends: 157 [2019-02-15 10:54:15,165 INFO L226 Difference]: Without dead ends: 156 [2019-02-15 10:54:15,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:54:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-15 10:54:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-02-15 10:54:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-15 10:54:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-02-15 10:54:15,275 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-02-15 10:54:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:15,275 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-02-15 10:54:15,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-02-15 10:54:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:15,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:15,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:15,276 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-02-15 10:54:15,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:15,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:15,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:15,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:15,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:15,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:15,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:15,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:15,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:15,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:15,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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:15,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:15,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:15,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:15,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:15,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:15,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-02-15 10:54:15,472 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-02-15 10:54:15,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:15,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:54:15,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:54:15,508 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:15,577 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:54:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:54:15,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:15,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:15,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,681 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:15,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:54:15,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:15,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-02-15 10:54:15,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 10:54:15,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:15,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-15 10:54:15,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:15,810 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:15,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:54:15,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:15,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:15,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:54:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:15,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:15,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:15,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:54:15,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:15,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:54:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:54:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:54:15,935 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-02-15 10:54:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:16,598 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-02-15 10:54:16,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:54:16,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:54:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:16,601 INFO L225 Difference]: With dead ends: 178 [2019-02-15 10:54:16,601 INFO L226 Difference]: Without dead ends: 177 [2019-02-15 10:54:16,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:54:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-15 10:54:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-02-15 10:54:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-15 10:54:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-02-15 10:54:16,707 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-02-15 10:54:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:16,708 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-02-15 10:54:16,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:54:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-02-15 10:54:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:16,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:16,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:16,709 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-02-15 10:54:16,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:16,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:16,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:16,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:16,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:16,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:16,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:16,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:16,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:16,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:16,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:16,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:16,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:16,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:16,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:16,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,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, 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-02-15 10:54:16,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:16,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:16,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:16,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:16,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:16,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:16,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:17,030 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:17,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:17,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:17,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:17,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,147 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:17,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 10:54:17,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:17,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:17,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-15 10:54:17,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:17,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:17,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:17,324 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:17,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-02-15 10:54:17,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:17,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:17,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:17,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:17,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:54:17,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:17,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:54:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:54:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:17,475 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-02-15 10:54:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:18,412 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-02-15 10:54:18,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:54:18,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:54:18,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:18,414 INFO L225 Difference]: With dead ends: 204 [2019-02-15 10:54:18,414 INFO L226 Difference]: Without dead ends: 203 [2019-02-15 10:54:18,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:54:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-15 10:54:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-02-15 10:54:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-15 10:54:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-02-15 10:54:18,515 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-02-15 10:54:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:18,515 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-02-15 10:54:18,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:54:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-02-15 10:54:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:18,515 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:18,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:18,516 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:18,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-02-15 10:54:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:18,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:18,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:18,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:18,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:18,638 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:18,638 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-15 10:54:18,639 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:18,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:18,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:18,642 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:54:18,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:18,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:18,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:18,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:18,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:18,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:18,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:18,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:18,677 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-02-15 10:54:18,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:18,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:54:18,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:54:18,765 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:18,786 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:18,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:18,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:18,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:18,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:18,834 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:54:18,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:54:18,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:18,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:18,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:18,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:18,929 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:18,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:54:18,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:18,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:18,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:54:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-02-15 10:54:19,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:19,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:19,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:54:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:19,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:19,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:19,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:54:19,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:19,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:54:19,152 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-02-15 10:54:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:19,739 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-02-15 10:54:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:54:19,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:19,741 INFO L225 Difference]: With dead ends: 178 [2019-02-15 10:54:19,741 INFO L226 Difference]: Without dead ends: 177 [2019-02-15 10:54:19,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-15 10:54:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-02-15 10:54:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-15 10:54:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-02-15 10:54:19,834 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-02-15 10:54:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:19,835 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-02-15 10:54:19,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-02-15 10:54:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:19,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:19,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:19,836 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-02-15 10:54:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:19,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:19,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:19,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:19,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:19,932 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-02-15 10:54:19,932 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:19,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:19,934 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:19,934 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:19,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:19,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:19,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:19,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:19,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:19,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:19,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:54:19,953 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-02-15 10:54:19,960 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-02-15 10:54:19,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:54:19,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:19,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:54:19,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:19,993 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:20,036 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-15 10:54:20,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:54:20,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:20,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:20,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 10:54:20,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:20,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:54:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:20,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:20,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:20,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:54:20,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:20,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:54:20,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:54:20,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:54:20,178 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-02-15 10:54:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:20,539 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-02-15 10:54:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:54:20,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:54:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:20,541 INFO L225 Difference]: With dead ends: 134 [2019-02-15 10:54:20,541 INFO L226 Difference]: Without dead ends: 133 [2019-02-15 10:54:20,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:54:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-15 10:54:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-02-15 10:54:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-15 10:54:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-02-15 10:54:20,640 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-02-15 10:54:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:20,640 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-02-15 10:54:20,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:54:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-02-15 10:54:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:20,640 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:20,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:20,641 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-02-15 10:54:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:20,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:20,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:20,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-02-15 10:54:20,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:20,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:20,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:20,787 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-02-15 10:54:20,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:20,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:20,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:20,789 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:54:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:20,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:20,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:20,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:20,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:20,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:20,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:20,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:54:20,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,812 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-02-15 10:54:20,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:20,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:54:20,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,841 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-02-15 10:54:20,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:20,924 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:20,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:20,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:20,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:20,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:21,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:54:21,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:21,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:21,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:21,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:21,116 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:21,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:54:21,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:21,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:21,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:21,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:21,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:21,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:54:21,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:21,247 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-02-15 10:54:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:21,835 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-02-15 10:54:21,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:54:21,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:21,837 INFO L225 Difference]: With dead ends: 143 [2019-02-15 10:54:21,838 INFO L226 Difference]: Without dead ends: 142 [2019-02-15 10:54:21,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:54:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-15 10:54:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-02-15 10:54:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-15 10:54:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-02-15 10:54:21,937 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-02-15 10:54:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:21,937 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-02-15 10:54:21,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-02-15 10:54:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:21,938 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:21,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:21,938 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:21,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-02-15 10:54:21,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:21,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:21,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:22,178 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-02-15 10:54:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:22,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:22,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:22,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:22,209 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-02-15 10:54:22,211 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:22,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:22,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:22,214 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:54:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:22,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:22,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:22,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:22,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:22,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:22,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:22,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:22,308 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-02-15 10:54:22,389 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-02-15 10:54:22,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:54:22,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:54:22,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,490 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:22,534 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-15 10:54:22,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:54:22,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:22,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:22,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:22,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:22,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:22,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:22,640 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:22,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 28 treesize of output 56 [2019-02-15 10:54:22,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:22,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:22,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:54:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:22,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:22,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:22,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:54:22,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:22,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:22,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:22,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:54:22,718 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-02-15 10:54:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:23,202 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-02-15 10:54:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:54:23,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:23,205 INFO L225 Difference]: With dead ends: 151 [2019-02-15 10:54:23,205 INFO L226 Difference]: Without dead ends: 150 [2019-02-15 10:54:23,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:54:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-15 10:54:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-02-15 10:54:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 10:54:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-02-15 10:54:23,311 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-02-15 10:54:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:23,311 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-02-15 10:54:23,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-02-15 10:54:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:23,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:23,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:23,312 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-02-15 10:54:23,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:23,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:23,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:23,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:23,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:23,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:23,464 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:23,464 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-15 10:54:23,464 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:23,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:23,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:23,467 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:54:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:23,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:23,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:23,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:23,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:23,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:23,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:23,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:23,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,494 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-02-15 10:54:23,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:54:23,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:23,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:23,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:23,597 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:23,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:23,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:23,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:23,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,817 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:23,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:54:23,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:23,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:23,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,899 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:23,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:54:23,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:23,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:23,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:23,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:23,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:54:23,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:24,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:24,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:24,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:24,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:24,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:54:24,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:24,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:54:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:54:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:24,127 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-02-15 10:54:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:25,049 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-02-15 10:54:25,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:54:25,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:54:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:25,052 INFO L225 Difference]: With dead ends: 215 [2019-02-15 10:54:25,052 INFO L226 Difference]: Without dead ends: 214 [2019-02-15 10:54:25,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:54:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-15 10:54:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-02-15 10:54:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-02-15 10:54:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-02-15 10:54:25,184 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-02-15 10:54:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:25,184 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-02-15 10:54:25,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:54:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-02-15 10:54:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:25,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:25,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:25,185 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-15 10:54:25,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:25,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:25,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:25,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:25,210 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:25,210 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-15 10:54:25,211 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:25,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:25,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:25,213 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:54:25,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:25,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:25,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:25,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:25,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:25,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:25,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:25,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:25,250 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-02-15 10:54:25,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:54:25,274 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-02-15 10:54:25,301 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-02-15 10:54:25,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:25,347 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-15 10:54:25,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:25,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 10:54:25,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 10:54:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:25,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:25,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:54:25,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:54:25,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:54:25,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:54:25,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:54:25,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:54:25,465 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-02-15 10:54:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:25,793 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-02-15 10:54:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:54:25,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-15 10:54:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:25,798 INFO L225 Difference]: With dead ends: 280 [2019-02-15 10:54:25,798 INFO L226 Difference]: Without dead ends: 275 [2019-02-15 10:54:25,798 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-02-15 10:54:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-02-15 10:54:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-02-15 10:54:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-02-15 10:54:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-02-15 10:54:26,040 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-02-15 10:54:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:26,040 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-02-15 10:54:26,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:54:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-02-15 10:54:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:26,041 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:26,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:26,041 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:26,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-02-15 10:54:26,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:26,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:26,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:26,232 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-02-15 10:54:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:26,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:26,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:26,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:26,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:26,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:26,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:26,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:26,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:26,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:26,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:26,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:26,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,335 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-02-15 10:54:26,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:54:26,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:54:26,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:54:26,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:26,445 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:26,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:26,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:26,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:26,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:54:26,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:26,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:26,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,659 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:26,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:54:26,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:26,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:26,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:26,750 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:26,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:54:26,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:26,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:26,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:26,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:26,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:26,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:54:26,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:26,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:54:26,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:54:26,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:26,894 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-02-15 10:54:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:27,895 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-02-15 10:54:27,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:54:27,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:54:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:27,899 INFO L225 Difference]: With dead ends: 329 [2019-02-15 10:54:27,899 INFO L226 Difference]: Without dead ends: 328 [2019-02-15 10:54:27,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:54:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-02-15 10:54:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-02-15 10:54:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-15 10:54:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-02-15 10:54:28,180 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-02-15 10:54:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:28,180 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-02-15 10:54:28,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:54:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-02-15 10:54:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:28,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:28,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:28,182 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:28,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-15 10:54:28,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:28,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:28,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:28,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:28,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:28,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:28,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:28,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:28,267 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-15 10:54:28,268 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:28,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:28,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:28,271 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:28,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:28,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:28,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:28,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:28,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:28,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:28,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, 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-02-15 10:54:28,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:54:28,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:28,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:54:28,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,380 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-02-15 10:54:28,381 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:28,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:28,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:28,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:28,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:28,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:28,449 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:54:28,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:54:28,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:28,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:28,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:28,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:28,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 31 treesize of output 65 [2019-02-15 10:54:28,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:28,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:28,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:28,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:28,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:28,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:54:28,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:28,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:54:28,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:54:28,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:54:28,634 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-02-15 10:54:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:29,192 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-02-15 10:54:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:54:29,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:54:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:29,195 INFO L225 Difference]: With dead ends: 290 [2019-02-15 10:54:29,195 INFO L226 Difference]: Without dead ends: 286 [2019-02-15 10:54:29,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:54:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-15 10:54:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-02-15 10:54:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-15 10:54:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-02-15 10:54:29,462 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-02-15 10:54:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:29,462 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-02-15 10:54:29,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:54:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-02-15 10:54:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:29,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:29,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:29,464 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-02-15 10:54:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:29,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:29,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:29,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:29,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:29,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:29,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:29,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:29,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:29,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:29,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:29,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:29,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:29,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:29,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:29,593 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-02-15 10:54:29,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, 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-02-15 10:54:29,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:54:29,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:54:29,632 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,647 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:29,692 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-15 10:54:29,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:54:29,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:29,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:29,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,765 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:29,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-02-15 10:54:29,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:29,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:29,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:29,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:54:29,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:29,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:29,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:29,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:30,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:30,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:54:30,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:30,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:30,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:30,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:30,020 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-02-15 10:54:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:30,647 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-02-15 10:54:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:54:30,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:30,651 INFO L225 Difference]: With dead ends: 307 [2019-02-15 10:54:30,651 INFO L226 Difference]: Without dead ends: 302 [2019-02-15 10:54:30,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-15 10:54:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-02-15 10:54:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-15 10:54:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-02-15 10:54:30,904 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-02-15 10:54:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:30,904 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-02-15 10:54:30,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-02-15 10:54:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:30,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:30,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:30,905 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-02-15 10:54:30,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:30,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:30,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:30,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:30,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:31,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:31,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:31,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:31,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:31,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:31,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:31,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:54:31,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:54:31,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:54:31,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:31,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:31,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:54:31,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,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, 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-02-15 10:54:31,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,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, 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-02-15 10:54:31,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:54:31,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,175 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-02-15 10:54:31,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,266 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:31,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:31,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:31,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:31,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,389 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:31,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:54:31,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,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-02-15 10:54:31,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:31,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,474 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:31,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:54:31,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:31,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:31,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:54:31,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:31,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:31,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,639 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:31,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:31,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:54:31,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:31,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:31,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:31,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:31,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 10:54:31,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:31,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:54:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:54:31,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:54:31,826 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-02-15 10:54:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:33,137 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-02-15 10:54:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:54:33,137 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 10:54:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:33,141 INFO L225 Difference]: With dead ends: 284 [2019-02-15 10:54:33,141 INFO L226 Difference]: Without dead ends: 279 [2019-02-15 10:54:33,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:54:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-15 10:54:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-02-15 10:54:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-15 10:54:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-02-15 10:54:33,392 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-02-15 10:54:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:33,392 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-02-15 10:54:33,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:54:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-02-15 10:54:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:33,393 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:33,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:33,393 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-02-15 10:54:33,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:33,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:33,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:33,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:33,678 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-15 10:54:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:33,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:33,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:33,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:33,956 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-15 10:54:33,958 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:33,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:33,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:33,960 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:33,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:33,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:33,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:33,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:33,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:34,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:34,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:54:34,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:54:34,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,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-02-15 10:54:34,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:34,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:34,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:34,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:34,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:34,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:34,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:34,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:34,263 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:34,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:34,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:34,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:34,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:34,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:34,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:54:34,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:34,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:34,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:34,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:54:34,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:34,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:54:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:54:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:54:34,466 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-02-15 10:54:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:35,007 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-02-15 10:54:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:54:35,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:54:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:35,009 INFO L225 Difference]: With dead ends: 230 [2019-02-15 10:54:35,009 INFO L226 Difference]: Without dead ends: 223 [2019-02-15 10:54:35,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:54:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-02-15 10:54:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-02-15 10:54:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-15 10:54:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-02-15 10:54:35,271 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-02-15 10:54:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:35,271 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-02-15 10:54:35,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:54:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-02-15 10:54:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:35,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:35,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:35,272 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-02-15 10:54:35,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:35,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:35,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:35,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:35,733 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-15 10:54:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:35,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:35,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:35,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:35,754 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-02-15 10:54:35,757 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:35,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:35,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:35,764 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:54:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:35,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:35,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:35,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:35,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:35,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:35,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:35,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:54:35,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:35,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:35,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:54:35,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:35,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:35,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:35,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:35,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:35,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:35,890 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:35,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:35,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:35,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:35,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:35,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:35,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:54:36,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:36,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:36,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:36,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:36,085 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:36,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-15 10:54:36,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:36,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:36,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:36,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:36,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:36,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-15 10:54:36,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:36,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:54:36,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:54:36,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:54:36,197 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-02-15 10:54:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:36,900 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-02-15 10:54:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:54:36,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 10:54:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:36,903 INFO L225 Difference]: With dead ends: 254 [2019-02-15 10:54:36,903 INFO L226 Difference]: Without dead ends: 253 [2019-02-15 10:54:36,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-02-15 10:54:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-02-15 10:54:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-15 10:54:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-02-15 10:54:37,179 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-02-15 10:54:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:37,180 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-02-15 10:54:37,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:54:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-02-15 10:54:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:37,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:37,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:37,181 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-02-15 10:54:37,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:37,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:37,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:37,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:37,571 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-15 10:54:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:37,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:37,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:37,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:37,582 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-15 10:54:37,582 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:37,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:37,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:37,584 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:37,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:37,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:37,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:37,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:37,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:37,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:37,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:54:37,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,607 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-02-15 10:54:37,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:54:37,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:37,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:37,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:37,682 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:37,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:37,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:37,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:37,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:37,737 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:37,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:37,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:37,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:37,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:37,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:37,846 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:37,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:54:37,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:37,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:37,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:37,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-02-15 10:54:37,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:37,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:37,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:54:37,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:37,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:54:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:54:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:54:37,949 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-02-15 10:54:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:38,416 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-02-15 10:54:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:54:38,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 10:54:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:38,418 INFO L225 Difference]: With dead ends: 223 [2019-02-15 10:54:38,418 INFO L226 Difference]: Without dead ends: 216 [2019-02-15 10:54:38,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:54:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-15 10:54:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-02-15 10:54:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-15 10:54:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-02-15 10:54:38,710 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-02-15 10:54:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:38,710 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-02-15 10:54:38,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:54:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-02-15 10:54:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:38,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:38,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:38,711 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-02-15 10:54:38,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:38,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:38,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:38,840 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-15 10:54:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:38,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:38,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:38,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:38,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:38,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:38,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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:38,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:54:38,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:54:38,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:54:38,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:38,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:38,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:54:38,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:38,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:54:38,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:38,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:38,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:38,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:38,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:38,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:38,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:39,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:39,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,035 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:39,090 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:39,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:39,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:39,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:39,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:54:39,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:39,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:39,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,296 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:39,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:54:39,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:39,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:39,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:39,392 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:39,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:54:39,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:39,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:39,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:39,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:39,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:39,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:54:39,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:39,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:54:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:54:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:54:39,576 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-02-15 10:54:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:40,697 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-02-15 10:54:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:54:40,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:54:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:40,701 INFO L225 Difference]: With dead ends: 285 [2019-02-15 10:54:40,702 INFO L226 Difference]: Without dead ends: 279 [2019-02-15 10:54:40,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:54:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-15 10:54:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-02-15 10:54:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-15 10:54:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-02-15 10:54:40,959 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-02-15 10:54:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:40,959 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-02-15 10:54:40,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:54:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-02-15 10:54:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:40,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:40,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:40,960 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:40,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-02-15 10:54:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:40,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:40,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:41,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:41,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:41,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:41,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:41,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:41,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:41,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:41,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:41,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:41,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:41,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:41,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:41,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,106 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-02-15 10:54:41,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:54:41,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,229 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-02-15 10:54:41,229 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-02-15 10:54:41,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:41,315 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:41,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:41,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,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-02-15 10:54:41,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:41,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,439 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:41,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:54:41,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,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-02-15 10:54:41,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:41,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:41,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:54:41,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:41,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:41,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:41,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:41,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:41,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:54:41,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:41,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:41,645 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-02-15 10:54:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:42,429 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-02-15 10:54:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:54:42,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:42,433 INFO L225 Difference]: With dead ends: 252 [2019-02-15 10:54:42,433 INFO L226 Difference]: Without dead ends: 247 [2019-02-15 10:54:42,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-15 10:54:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-02-15 10:54:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 10:54:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-02-15 10:54:42,687 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-02-15 10:54:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:42,687 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-02-15 10:54:42,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-02-15 10:54:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:42,688 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:42,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:42,688 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-15 10:54:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:42,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:42,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:42,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:42,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:42,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:42,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:42,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:42,761 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-15 10:54:42,762 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:42,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:42,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:42,763 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:42,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:42,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:42,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:42,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:42,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:42,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:42,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:54:42,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:54:42,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:42,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:54:42,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:42,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:42,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:42,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:42,865 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:42,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:42,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:42,894 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:42,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:54:42,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:42,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:42,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:42,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:42,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:43,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:43,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:43,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:43,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:54:43,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:43,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:43,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:43,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-02-15 10:54:43,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:43,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:43,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:54:43,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:43,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:54:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:54:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:54:43,112 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-02-15 10:54:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:43,617 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-02-15 10:54:43,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:54:43,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 10:54:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:43,619 INFO L225 Difference]: With dead ends: 194 [2019-02-15 10:54:43,620 INFO L226 Difference]: Without dead ends: 193 [2019-02-15 10:54:43,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:54:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-15 10:54:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-02-15 10:54:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-15 10:54:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-02-15 10:54:43,875 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-02-15 10:54:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:43,875 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-02-15 10:54:43,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:54:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-02-15 10:54:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:43,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:43,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:43,876 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-02-15 10:54:43,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:43,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:43,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:44,042 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-15 10:54:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:44,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:44,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:44,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:44,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:44,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:44,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:44,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:44,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:44,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:44,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:44,124 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-02-15 10:54:44,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:44,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:54:44,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:54:44,166 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,186 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:44,234 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:54:44,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:54:44,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:44,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:44,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:54:44,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:44,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:44,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,398 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:44,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:44,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 76 [2019-02-15 10:54:44,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:44,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-02-15 10:54:44,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:54:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:44,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:44,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:44,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:54:44,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:44,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:44,510 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-02-15 10:54:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:45,352 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-02-15 10:54:45,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:54:45,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:54:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:45,355 INFO L225 Difference]: With dead ends: 265 [2019-02-15 10:54:45,355 INFO L226 Difference]: Without dead ends: 264 [2019-02-15 10:54:45,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:54:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-15 10:54:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-02-15 10:54:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-15 10:54:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-02-15 10:54:45,673 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-02-15 10:54:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:45,673 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-02-15 10:54:45,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-02-15 10:54:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:45,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:45,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:45,674 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-02-15 10:54:45,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:45,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:45,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:45,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:45,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:45,738 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:45,739 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-15 10:54:45,739 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:45,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:45,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:45,741 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:45,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:45,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:45,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:45,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:45,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:45,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:45,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:45,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-02-15 10:54:45,766 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-02-15 10:54:45,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:54:45,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:54:45,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:54:45,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:45,822 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:45,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:45,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:45,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:45,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-02-15 10:54:45,866 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-15 10:54:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:54:45,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:45,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:45,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:45,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:45,937 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:45,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-02-15 10:54:45,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:45,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:45,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:45,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:46,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:46,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:54:46,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:46,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:54:46,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:54:46,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:54:46,022 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-02-15 10:54:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:46,506 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-02-15 10:54:46,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:54:46,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 10:54:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:46,507 INFO L225 Difference]: With dead ends: 210 [2019-02-15 10:54:46,507 INFO L226 Difference]: Without dead ends: 203 [2019-02-15 10:54:46,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:54:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-15 10:54:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-02-15 10:54:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-15 10:54:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-02-15 10:54:46,825 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-02-15 10:54:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:46,825 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-02-15 10:54:46,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:54:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-02-15 10:54:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:54:46,826 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:46,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:46,826 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-02-15 10:54:46,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:46,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:46,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:46,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:46,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:46,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:46,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:46,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:54:46,925 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-02-15 10:54:46,925 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:46,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:46,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:46,927 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:54:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:46,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:46,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:46,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:46,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:46,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:46,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:46,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:46,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:54:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:46,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:54:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:46,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:46,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:54:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:46,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:46,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:46,987 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-02-15 10:54:46,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:47,055 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:54:47,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:54:47,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:47,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:47,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:47,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:54:47,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:47,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:54:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:47,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:47,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:47,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:54:47,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:47,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:54:47,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:54:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:54:47,591 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-02-15 10:54:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:48,212 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-02-15 10:54:48,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:54:48,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 10:54:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:48,214 INFO L225 Difference]: With dead ends: 216 [2019-02-15 10:54:48,214 INFO L226 Difference]: Without dead ends: 212 [2019-02-15 10:54:48,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:54:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-15 10:54:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-02-15 10:54:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-02-15 10:54:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-02-15 10:54:48,559 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-02-15 10:54:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:48,559 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-02-15 10:54:48,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:54:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-02-15 10:54:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:54:48,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:48,560 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:48,560 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:48,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-02-15 10:54:48,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:48,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:48,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:48,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:48,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:48,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:48,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:48,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:48,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:48,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:48,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:48,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:48,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:54:48,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:48,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:48,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 18 treesize of output 21 [2019-02-15 10:54:48,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,675 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-02-15 10:54:48,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,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-02-15 10:54:48,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:48,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,693 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-02-15 10:54:48,693 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:48,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:48,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:48,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:48,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:48,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:48,779 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:48,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:48,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:48,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:48,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:48,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,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, 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-02-15 10:54:48,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:48,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-02-15 10:54:48,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:48,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:48,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:54:48,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:49,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:49,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:49,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:49,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:49,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:54:49,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:49,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:54:49,080 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-02-15 10:54:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:50,123 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-02-15 10:54:50,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:54:50,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 10:54:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:50,127 INFO L225 Difference]: With dead ends: 401 [2019-02-15 10:54:50,127 INFO L226 Difference]: Without dead ends: 397 [2019-02-15 10:54:50,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-02-15 10:54:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-02-15 10:54:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-02-15 10:54:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-02-15 10:54:50,739 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-02-15 10:54:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:50,739 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-02-15 10:54:50,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:54:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-02-15 10:54:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:54:50,740 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:50,740 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:50,740 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:50,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-02-15 10:54:50,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:50,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:50,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:54:50,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:54:50,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:54:50,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:54:50,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:54:50,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:54:50,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:54:50,813 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-02-15 10:54:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:51,428 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-02-15 10:54:51,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:54:51,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-15 10:54:51,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:51,430 INFO L225 Difference]: With dead ends: 347 [2019-02-15 10:54:51,430 INFO L226 Difference]: Without dead ends: 342 [2019-02-15 10:54:51,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:54:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-15 10:54:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-02-15 10:54:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-02-15 10:54:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-02-15 10:54:52,040 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-02-15 10:54:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:52,040 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-02-15 10:54:52,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:54:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-02-15 10:54:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:54:52,041 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:52,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:52,041 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-02-15 10:54:52,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:52,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:52,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:52,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:52,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:52,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:52,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:52,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:54:52,246 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-15 10:54:52,247 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:52,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:52,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:52,249 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 10:54:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:52,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:52,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:52,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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:52,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:52,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:52,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:52,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:52,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,272 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-02-15 10:54:52,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:52,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,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, 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-02-15 10:54:52,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,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-02-15 10:54:52,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,502 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:52,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:54:52,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:52,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:52,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:54:52,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:52,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:52,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,706 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:52,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:54:52,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,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-02-15 10:54:52,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:52,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,799 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:52,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:54:52,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:52,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:52,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,888 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:52,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:52,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:54:52,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:52,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:52,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:52,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:53,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:53,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 10:54:53,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:53,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:54:53,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:54:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:54:53,061 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-02-15 10:54:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:54,733 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-02-15 10:54:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:54:54,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-15 10:54:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:54,736 INFO L225 Difference]: With dead ends: 471 [2019-02-15 10:54:54,736 INFO L226 Difference]: Without dead ends: 470 [2019-02-15 10:54:54,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:54:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-02-15 10:54:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-02-15 10:54:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-02-15 10:54:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-02-15 10:54:55,380 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-02-15 10:54:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:55,380 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-02-15 10:54:55,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:54:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-02-15 10:54:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:54:55,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:55,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:55,382 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:55,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-02-15 10:54:55,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:55,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:54:55,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:55,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:55,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:55,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:55,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:55,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:55,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:55,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:55,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:54:55,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:55,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:55,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 18 treesize of output 21 [2019-02-15 10:54:55,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:54:55,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:54:55,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:55,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:54:55,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,818 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:54:55,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,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 36 treesize of output 66 [2019-02-15 10:54:55,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:55,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:54:55,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:55,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 38 treesize of output 80 [2019-02-15 10:54:55,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:55,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:55,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:54:56,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,035 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:56,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:54:56,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:56,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:56,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-15 10:54:56,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,129 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:56,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-02-15 10:54:56,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:56,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:56,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:56,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:56,223 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:56,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 10:54:56,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:56,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:56,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:54:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:56,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:56,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:56,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 10:54:56,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:56,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:54:56,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:54:56,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:54:56,396 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-02-15 10:54:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:58,115 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-02-15 10:54:58,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:54:58,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-15 10:54:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:58,118 INFO L225 Difference]: With dead ends: 483 [2019-02-15 10:54:58,118 INFO L226 Difference]: Without dead ends: 482 [2019-02-15 10:54:58,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:54:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-02-15 10:54:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-02-15 10:54:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-02-15 10:54:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-02-15 10:54:58,779 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-02-15 10:54:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:58,779 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-02-15 10:54:58,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:54:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-02-15 10:54:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:54:58,781 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:58,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:54:58,781 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:58,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-02-15 10:54:58,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:58,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:58,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:58,915 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-15 10:54:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:58,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:58,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:58,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:54:58,975 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 10:54:58,976 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:54:58,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:54:58,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:54:58,978 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:54:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:58,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:54:58,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:58,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:58,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:58,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:58,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:59,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:54:59,003 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-02-15 10:54:59,006 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-02-15 10:54:59,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:54:59,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:54:59,027 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,042 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:59,265 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-15 10:54:59,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:54:59,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-02-15 10:54:59,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-02-15 10:54:59,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:59,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-02-15 10:54:59,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:54:59,374 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:54:59,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:54:59,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:59,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:54:59,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:54:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:59,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:59,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:59,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:54:59,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:59,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:54:59,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:54:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:54:59,464 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-02-15 10:55:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:00,448 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-02-15 10:55:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:55:00,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 10:55:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:00,449 INFO L225 Difference]: With dead ends: 400 [2019-02-15 10:55:00,449 INFO L226 Difference]: Without dead ends: 393 [2019-02-15 10:55:00,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-15 10:55:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-02-15 10:55:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-02-15 10:55:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-02-15 10:55:01,151 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-02-15 10:55:01,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:01,152 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-02-15 10:55:01,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:55:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-02-15 10:55:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:01,153 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:01,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:01,154 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-02-15 10:55:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:01,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:01,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:01,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:01,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:01,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:01,292 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-15 10:55:01,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:01,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:01,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:01,294 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:55:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:01,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:01,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:01,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:01,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:01,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:01,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:01,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:55:01,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:55:01,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:55:01,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:55:01,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:01,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,380 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:01,452 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:01,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:55:01,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:01,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:01,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:55:01,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:01,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:01,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:01,900 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:01,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:55:01,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:01,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:01,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:01,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:02,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:02,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:55:02,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:02,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:55:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:55:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:55:02,050 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-02-15 10:55:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:03,121 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-02-15 10:55:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:55:03,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 10:55:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:03,123 INFO L225 Difference]: With dead ends: 409 [2019-02-15 10:55:03,123 INFO L226 Difference]: Without dead ends: 397 [2019-02-15 10:55:03,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-02-15 10:55:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-02-15 10:55:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-02-15 10:55:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-02-15 10:55:03,794 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-02-15 10:55:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:03,794 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-02-15 10:55:03,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:55:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-02-15 10:55:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:03,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:03,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:03,795 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-02-15 10:55:03,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:03,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:03,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:03,978 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-02-15 10:55:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:04,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:04,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:04,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:04,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:04,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:04,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:04,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:04,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:04,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:04,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:04,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:55:04,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,158 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-02-15 10:55:04,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,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 23 treesize of output 37 [2019-02-15 10:55:04,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:55:04,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:04,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,262 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:04,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:55:04,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:04,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:55:04,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:04,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:04,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,542 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:04,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:55:04,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:04,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-02-15 10:55:04,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,642 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:04,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:55:04,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:04,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:55:04,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:04,735 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:04,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, 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-02-15 10:55:04,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:04,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:04,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:55:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:04,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:04,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:04,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 10:55:04,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:04,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:55:04,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:55:04,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:55:04,917 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-02-15 10:55:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:06,863 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-02-15 10:55:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:55:06,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-15 10:55:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:06,866 INFO L225 Difference]: With dead ends: 542 [2019-02-15 10:55:06,866 INFO L226 Difference]: Without dead ends: 536 [2019-02-15 10:55:06,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:55:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-02-15 10:55:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-02-15 10:55:07,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-02-15 10:55:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-02-15 10:55:07,798 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-02-15 10:55:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:07,798 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-02-15 10:55:07,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:55:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-02-15 10:55:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:07,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:07,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:07,800 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-02-15 10:55:07,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:07,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:07,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:07,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:07,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:07,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:07,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:07,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:07,983 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-15 10:55:07,984 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:07,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:07,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:07,992 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:55:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:07,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:07,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:07,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:08,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:08,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:08,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:08,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, 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-02-15 10:55:08,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,062 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-02-15 10:55:08,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:55:08,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:08,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,091 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-02-15 10:55:08,091 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:08,173 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:08,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:55:08,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:08,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:08,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:55:08,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:08,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:08,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:08,374 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:08,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-02-15 10:55:08,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:08,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:08,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:08,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:08,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:08,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:55:08,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:08,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:55:08,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:55:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:55:08,500 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-02-15 10:55:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:09,786 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-02-15 10:55:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:55:09,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 10:55:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:09,789 INFO L225 Difference]: With dead ends: 469 [2019-02-15 10:55:09,789 INFO L226 Difference]: Without dead ends: 465 [2019-02-15 10:55:09,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:55:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-02-15 10:55:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-02-15 10:55:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-02-15 10:55:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-02-15 10:55:10,664 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-02-15 10:55:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:10,664 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-02-15 10:55:10,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:55:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-02-15 10:55:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:10,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:10,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:10,666 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:10,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-02-15 10:55:10,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:10,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:10,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:10,845 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-02-15 10:55:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:11,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:11,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:11,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:11,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:11,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:11,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:11,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:11,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:11,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:11,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:11,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,145 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-02-15 10:55:11,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:55:11,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:11,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:11,166 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,250 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:11,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:55:11,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:11,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:11,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,369 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:11,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 10:55:11,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:11,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-02-15 10:55:11,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:55:11,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:11,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-02-15 10:55:11,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,543 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:11,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 10:55:11,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:11,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:55:11,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:11,642 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:11,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:55:11,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:11,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:11,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:55:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:11,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 10:55:11,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:11,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:55:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:55:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:55:11,841 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-02-15 10:55:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:13,601 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-02-15 10:55:13,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:55:13,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-15 10:55:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:13,605 INFO L225 Difference]: With dead ends: 481 [2019-02-15 10:55:13,605 INFO L226 Difference]: Without dead ends: 480 [2019-02-15 10:55:13,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:55:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-02-15 10:55:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-02-15 10:55:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-02-15 10:55:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-02-15 10:55:14,103 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-02-15 10:55:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:14,103 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-02-15 10:55:14,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:55:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-02-15 10:55:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:14,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:14,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:14,104 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-02-15 10:55:14,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:14,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:14,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:14,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:14,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:14,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:14,192 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-02-15 10:55:14,192 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:14,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:14,194 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:14,194 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:55:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:14,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:14,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:14,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:14,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:14,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:14,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:14,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:14,216 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-02-15 10:55:14,227 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-02-15 10:55:14,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:55:14,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-02-15 10:55:14,248 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:14,307 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-15 10:55:14,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:55:14,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:14,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-15 10:55:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:14,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 10:55:14,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:14,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-15 10:55:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:14,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:14,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:14,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:55:14,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:14,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:55:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:55:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:55:14,454 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-02-15 10:55:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:15,143 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-02-15 10:55:15,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:55:15,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-15 10:55:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:15,145 INFO L225 Difference]: With dead ends: 267 [2019-02-15 10:55:15,145 INFO L226 Difference]: Without dead ends: 258 [2019-02-15 10:55:15,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:55:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-15 10:55:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-15 10:55:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-15 10:55:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-02-15 10:55:15,714 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-02-15 10:55:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:15,714 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-02-15 10:55:15,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:55:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-02-15 10:55:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:15,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:15,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:15,715 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-02-15 10:55:15,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:15,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:15,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:15,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:15,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:15,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:15,945 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-02-15 10:55:15,946 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:15,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:15,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:15,948 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:55:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:15,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:15,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:15,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:15,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:15,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:15,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:15,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:15,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:55:15,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:55:15,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:15,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:15,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:55:16,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,113 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:16,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:16,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:16,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:16,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:55:16,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:16,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:16,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,336 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:16,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:55:16,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:16,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:16,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,427 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:16,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:16,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:55:16,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:16,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:16,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:55:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:16,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:16,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:16,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:55:16,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:16,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:55:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:55:16,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:16,601 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-02-15 10:55:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:17,847 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-02-15 10:55:17,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:55:17,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 10:55:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:17,851 INFO L225 Difference]: With dead ends: 309 [2019-02-15 10:55:17,851 INFO L226 Difference]: Without dead ends: 306 [2019-02-15 10:55:17,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:55:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-15 10:55:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-02-15 10:55:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-15 10:55:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-02-15 10:55:18,464 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-02-15 10:55:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:18,464 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-02-15 10:55:18,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:55:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-02-15 10:55:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:18,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:18,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:18,465 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-02-15 10:55:18,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:18,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:18,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:18,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:18,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:18,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:18,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:18,553 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:18,553 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 10:55:18,554 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:18,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:18,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:18,557 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:55:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:18,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:18,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:18,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:18,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:18,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:18,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:18,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:18,578 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-02-15 10:55:18,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:55:18,610 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-02-15 10:55:18,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55: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, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-15 10:55:18,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:18,676 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-02-15 10:55:18,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:18,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:18,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:55:18,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-15 10:55:18,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:18,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:18,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:18,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:18,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:55:18,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:18,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:18,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-15 10:55:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:18,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:18,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:18,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 10:55:18,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:18,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:55:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:55:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:55:18,784 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-02-15 10:55:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:19,920 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-02-15 10:55:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:55:19,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 10:55:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:19,923 INFO L225 Difference]: With dead ends: 379 [2019-02-15 10:55:19,923 INFO L226 Difference]: Without dead ends: 366 [2019-02-15 10:55:19,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:55:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-15 10:55:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-02-15 10:55:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-02-15 10:55:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-02-15 10:55:20,648 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-02-15 10:55:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:20,648 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-02-15 10:55:20,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:55:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-02-15 10:55:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:20,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:20,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:20,649 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-02-15 10:55:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:20,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:20,817 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-02-15 10:55:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:20,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:20,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:20,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:20,898 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-02-15 10:55:20,898 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:20,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:20,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:20,901 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:55:20,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:20,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:20,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:20,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:20,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:20,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:20,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:20,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:55:20,925 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-02-15 10:55:20,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:20,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:55:20,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:20,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:20,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:55:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:20,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:20,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:20,952 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-02-15 10:55:20,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:21,120 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:55:21,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:55:21,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:21,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:21,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:55:21,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:21,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:21,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,323 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:21,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:55:21,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:21,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:55:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:21,387 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:21,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:55:21,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:21,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:21,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:55:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:21,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:21,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:21,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:55:21,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:21,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:55:21,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:55:21,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:21,507 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-02-15 10:55:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:23,201 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-02-15 10:55:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:55:23,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-15 10:55:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:23,204 INFO L225 Difference]: With dead ends: 371 [2019-02-15 10:55:23,204 INFO L226 Difference]: Without dead ends: 366 [2019-02-15 10:55:23,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:55:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-15 10:55:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-02-15 10:55:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-15 10:55:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-02-15 10:55:24,132 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-02-15 10:55:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:24,132 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-02-15 10:55:24,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:55:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-02-15 10:55:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:24,133 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:24,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:24,133 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-02-15 10:55:24,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:24,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:24,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:24,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:24,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:24,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:24,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:24,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:24,257 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-02-15 10:55:24,258 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:24,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:24,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:24,260 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:55:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:24,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:24,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:24,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:24,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:24,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:24,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:24,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:55:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,285 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-02-15 10:55:24,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:55:24,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:24,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,311 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-02-15 10:55:24,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:24,395 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:24,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:24,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:24,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:24,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,512 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:24,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:55:24,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,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-02-15 10:55:24,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:24,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:55:24,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:24,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:24,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:24,684 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:24,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:55:24,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:24,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:24,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:24,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:24,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:55:24,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:24,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:55:24,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:55:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:24,825 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-02-15 10:55:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:26,315 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-02-15 10:55:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:55:26,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 10:55:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:26,316 INFO L225 Difference]: With dead ends: 285 [2019-02-15 10:55:26,316 INFO L226 Difference]: Without dead ends: 284 [2019-02-15 10:55:26,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:55:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-15 10:55:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-02-15 10:55:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-15 10:55:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-02-15 10:55:27,194 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-02-15 10:55:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:27,194 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-02-15 10:55:27,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:55:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-02-15 10:55:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:27,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:27,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:27,195 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-02-15 10:55:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:27,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:27,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:27,360 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-15 10:55:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:27,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:27,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:27,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:27,415 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-15 10:55:27,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:27,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:27,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:27,418 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:55:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:27,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:27,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:27,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:27,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:27,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:27,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:27,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:55:27,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:55:27,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:27,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,511 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-02-15 10:55:27,511 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:27,598 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:27,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:27,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:27,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:27,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,713 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:27,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:55:27,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:27,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:27,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:27,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:55:27,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:27,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:27,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:27,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:27,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:55:27,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:27,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:55:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:55:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:55:27,928 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-02-15 10:55:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:29,280 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-02-15 10:55:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:55:29,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 10:55:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:29,282 INFO L225 Difference]: With dead ends: 281 [2019-02-15 10:55:29,282 INFO L226 Difference]: Without dead ends: 274 [2019-02-15 10:55:29,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-15 10:55:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-02-15 10:55:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-02-15 10:55:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-02-15 10:55:30,234 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-02-15 10:55:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:30,234 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-02-15 10:55:30,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:55:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-02-15 10:55:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:30,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:30,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:30,235 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-02-15 10:55:30,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:30,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:30,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:30,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:30,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:30,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:30,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:30,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:30,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:30,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:30,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:30,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:55:30,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:30,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:30,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:55:30,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:55:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:55:30,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,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, 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-02-15 10:55:30,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:30,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:30,521 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:30,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:30,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:30,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:30,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,653 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:30,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:55:30,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:30,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:30,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,739 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:30,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:55:30,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:30,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:30,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:55:30,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:30,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:30,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:30,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:30,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:30,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:55:30,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:30,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:55:30,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:55:30,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:55:30,974 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-02-15 10:55:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:32,669 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-02-15 10:55:32,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:55:32,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-15 10:55:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:32,671 INFO L225 Difference]: With dead ends: 295 [2019-02-15 10:55:32,671 INFO L226 Difference]: Without dead ends: 288 [2019-02-15 10:55:32,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:55:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-02-15 10:55:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-02-15 10:55:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-02-15 10:55:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-02-15 10:55:33,675 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-02-15 10:55:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:33,676 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-02-15 10:55:33,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:55:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-02-15 10:55:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:33,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:33,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:33,676 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-02-15 10:55:33,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:33,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:33,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:33,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:33,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:33,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:33,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:33,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:33,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:33,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:33,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:55:33,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:33,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:33,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:33,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:55:33,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:33,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:55:33,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:33,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:33,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:55:33,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:33,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:33,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:33,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:33,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:33,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:33,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:33,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:33,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:33,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:33,967 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:55:34,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:55:34,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:34,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:34,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:34,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,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 31 treesize of output 65 [2019-02-15 10:55:34,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:34,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:34,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:34,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,138 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:34,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:55:34,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:34,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:34,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:55:34,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:34,207 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:34,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:55:34,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:34,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:34,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:55:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:34,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:34,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:34,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:55:34,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:34,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:55:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:55:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:55:34,351 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-02-15 10:55:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:36,284 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-02-15 10:55:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:55:36,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-15 10:55:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:36,287 INFO L225 Difference]: With dead ends: 370 [2019-02-15 10:55:36,287 INFO L226 Difference]: Without dead ends: 363 [2019-02-15 10:55:36,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:55:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-02-15 10:55:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-02-15 10:55:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-02-15 10:55:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-02-15 10:55:37,418 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-02-15 10:55:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:37,418 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-02-15 10:55:37,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:55:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-02-15 10:55:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:37,419 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:37,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:37,419 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-02-15 10:55:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:37,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:37,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:37,823 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-02-15 10:55:37,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-02-15 10:55:37,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:37,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:37,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:37,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:37,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:37,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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:37,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:37,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:37,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:37,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:37,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, 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-02-15 10:55:37,925 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-02-15 10:55:37,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:37,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:55:37,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:37,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:37,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:55:37,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:37,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:37,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:37,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:37,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:37,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:37,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:37,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:37,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:38,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:38,012 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:55:38,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:55:38,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:38,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:38,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:38,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,115 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:55:38,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:38,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:38,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:38,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:55:38,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:38,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:38,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:38,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,235 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:38,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:38,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:55:38,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:38,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:38,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:55:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:38,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:38,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:55:38,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:55:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:55:38,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:55:38,366 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-02-15 10:55:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:40,174 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-02-15 10:55:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:55:40,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-15 10:55:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:40,175 INFO L225 Difference]: With dead ends: 349 [2019-02-15 10:55:40,175 INFO L226 Difference]: Without dead ends: 344 [2019-02-15 10:55:40,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:55:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-15 10:55:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-02-15 10:55:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-15 10:55:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-02-15 10:55:41,156 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-02-15 10:55:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:41,156 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-02-15 10:55:41,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:55:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-02-15 10:55:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:41,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:41,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:41,157 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:41,157 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-02-15 10:55:41,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:41,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:41,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:41,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:41,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:41,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:41,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:41,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:41,306 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-15 10:55:41,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:41,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:41,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:41,308 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:55:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:41,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:41,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:41,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:41,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:41,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:41,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:41,381 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-02-15 10:55:41,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:55:41,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:55:41,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,403 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-02-15 10:55:41,403 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:41,473 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:55:41,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:55:41,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:41,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:41,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,634 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:41,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:55:41,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:41,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:41,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:41,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:55:41,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:41,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:41,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:41,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:41,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:41,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:55:41,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:41,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:55:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:55:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:55:41,922 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-02-15 10:55:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:43,340 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-02-15 10:55:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:55:43,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 10:55:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:43,341 INFO L225 Difference]: With dead ends: 257 [2019-02-15 10:55:43,341 INFO L226 Difference]: Without dead ends: 250 [2019-02-15 10:55:43,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-15 10:55:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-02-15 10:55:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-02-15 10:55:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-02-15 10:55:44,351 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-02-15 10:55:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:44,352 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-02-15 10:55:44,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:55:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-02-15 10:55:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:44,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:44,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:44,352 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-02-15 10:55:44,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:44,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:44,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:44,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:44,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:44,557 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-15 10:55:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:44,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:44,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:44,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:44,621 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-02-15 10:55:44,621 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:44,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:44,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:44,623 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:55:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:44,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:44,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:44,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:44,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:44,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:44,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:44,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:55:44,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,665 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-02-15 10:55:44,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:55:44,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:44,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:44,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:44,767 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:44,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:44,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:44,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:44,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:55:44,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:44,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:44,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,976 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:44,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:44,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:55:44,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:45,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:45,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:55:45,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:45,076 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:45,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-02-15 10:55:45,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:45,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:45,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:55:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:45,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:45,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:55:45,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:45,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:55:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:55:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:45,234 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-02-15 10:55:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:47,149 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-02-15 10:55:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:55:47,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 10:55:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:47,151 INFO L225 Difference]: With dead ends: 316 [2019-02-15 10:55:47,151 INFO L226 Difference]: Without dead ends: 315 [2019-02-15 10:55:47,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:55:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-15 10:55:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-02-15 10:55:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-02-15 10:55:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-02-15 10:55:48,189 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-02-15 10:55:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-02-15 10:55:48,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:55:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-02-15 10:55:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:48,190 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:48,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:48,190 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-02-15 10:55:48,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:48,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:48,379 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-15 10:55:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:48,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:48,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:48,431 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:48,431 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-15 10:55:48,432 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:48,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:48,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:48,434 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:55:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:48,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:48,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:48,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:48,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:48,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:48,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:48,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,527 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-02-15 10:55:48,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:55:48,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:48,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,621 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-02-15 10:55:48,622 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:48,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:48,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:48,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:48,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:48,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:48,706 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:48,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,921 INFO L303 Elim1Store]: Index analysis took 194 ms [2019-02-15 10:55:48,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:48,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:48,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:48,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:48,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:48,998 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:48,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:55:48,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:49,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:49,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:49,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:49,081 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:49,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:55:49,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:49,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:49,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:49,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:49,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:49,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:55:49,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:49,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:55:49,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:55:49,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:55:49,210 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-02-15 10:55:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:50,649 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-02-15 10:55:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:55:50,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 10:55:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:50,650 INFO L225 Difference]: With dead ends: 253 [2019-02-15 10:55:50,650 INFO L226 Difference]: Without dead ends: 246 [2019-02-15 10:55:50,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-15 10:55:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-02-15 10:55:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-02-15 10:55:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-02-15 10:55:51,692 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-02-15 10:55:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:51,692 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-02-15 10:55:51,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:55:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-02-15 10:55:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:51,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:51,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:51,693 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-02-15 10:55:51,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:51,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:51,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:55:51,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:51,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:51,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:51,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:51,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:51,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:51,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:51,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:52,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:55:52,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:52,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:52,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:55:52,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:55:52,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:55:52,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:52,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:55:52,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:52,138 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:52,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:52,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:52,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:52,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:55:52,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:52,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:52,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,356 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:52,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:55:52,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:52,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:52,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:52,452 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:52,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-02-15 10:55:52,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:52,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:52,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:55:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:52,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:52,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:52,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:55:52,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:52,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:55:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:55:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:55:52,624 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-02-15 10:55:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:54,712 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-02-15 10:55:54,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:55:54,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-15 10:55:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:54,714 INFO L225 Difference]: With dead ends: 332 [2019-02-15 10:55:54,714 INFO L226 Difference]: Without dead ends: 328 [2019-02-15 10:55:54,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:55:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-02-15 10:55:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-02-15 10:55:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-15 10:55:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-02-15 10:55:55,720 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-02-15 10:55:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:55,720 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-02-15 10:55:55,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:55:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-02-15 10:55:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:55,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:55,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:55,721 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-02-15 10:55:55,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:55,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:55,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:55:55,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:55,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:55,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:55,891 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-15 10:55:55,892 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:55,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:55,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:55,894 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:55:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:55,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:55,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:55,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:55,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:55,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:55,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:55,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:55:55,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:55:55,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:55:55,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:55,935 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-02-15 10:55:55,935 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:55,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:55,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:55,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:55,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:56,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:56,019 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:55:56,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:55:56,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:56,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:56,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:56,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,136 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:56,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:55:56,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:56,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:56,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:56,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:56,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:55:56,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:56,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:56,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 10:55:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:56,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:56,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:55:56,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:56,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:55:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:55:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:55:56,345 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-02-15 10:55:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:57,763 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-02-15 10:55:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:55:57,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 10:55:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:57,765 INFO L225 Difference]: With dead ends: 242 [2019-02-15 10:55:57,765 INFO L226 Difference]: Without dead ends: 241 [2019-02-15 10:55:57,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:55:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-02-15 10:55:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-02-15 10:55:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 10:55:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-02-15 10:55:58,834 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-02-15 10:55:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:58,834 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-02-15 10:55:58,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:55:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-02-15 10:55:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:55:58,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:58,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:55:58,840 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-02-15 10:55:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:58,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:58,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:58,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:58,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:55:58,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:58,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:58,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:55:58,959 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-15 10:55:58,960 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:55:58,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:55:58,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:55:58,961 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:55:58,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:58,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:55:58,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:58,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:58,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:58,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:58,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:58,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:55:58,984 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-02-15 10:55:58,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:58,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:55:59,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:55:59,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,018 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-02-15 10:55:59,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:59,085 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:55:59,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:55:59,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:59,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:55:59,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,186 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:55:59,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-15 10:55:59,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:59,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:55:59,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:55:59,354 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-02-15 10:55:59,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 35 treesize of output 61 [2019-02-15 10:55:59,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:55:59,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:55:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:59,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:59,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:59,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:55:59,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:59,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:55:59,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:55:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:55:59,464 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-02-15 10:56:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:00,980 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-02-15 10:56:00,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:00,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 10:56:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:00,981 INFO L225 Difference]: With dead ends: 254 [2019-02-15 10:56:00,981 INFO L226 Difference]: Without dead ends: 245 [2019-02-15 10:56:00,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:56:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-02-15 10:56:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-02-15 10:56:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-15 10:56:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-02-15 10:56:02,064 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-02-15 10:56:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:02,064 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-02-15 10:56:02,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:56:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-02-15 10:56:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:56:02,065 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:02,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:02,065 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-02-15 10:56:02,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:02,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:02,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:02,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:02,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:56:02,258 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-02-15 10:56:02,259 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:02,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:02,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:02,260 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:56:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:02,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:02,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:02,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:02,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:02,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:02,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:02,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, 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-02-15 10:56:02,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:56:02,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:56:02,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:56:02,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:56:02,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:02,408 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:56:02,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:56:02,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:02,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:02,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,512 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:02,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-15 10:56:02,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:02,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:56:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:02,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-02-15 10:56:02,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:02,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:02,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:56:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:02,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:02,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:02,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:56:02,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:02,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:56:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:56:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:56:02,701 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-02-15 10:56:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:04,177 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-02-15 10:56:04,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:04,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 10:56:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:04,178 INFO L225 Difference]: With dead ends: 249 [2019-02-15 10:56:04,179 INFO L226 Difference]: Without dead ends: 248 [2019-02-15 10:56:04,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:56:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-15 10:56:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-02-15 10:56:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-15 10:56:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-02-15 10:56:05,272 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-02-15 10:56:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:05,272 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-02-15 10:56:05,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:56:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-02-15 10:56:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:56:05,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:05,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:05,273 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-02-15 10:56:05,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:05,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:05,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:05,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:05,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:05,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:56:05,347 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-02-15 10:56:05,348 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:05,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:05,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:05,349 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:05,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:05,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:05,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:05,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:05,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:05,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:05,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,377 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-02-15 10:56:05,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:56:05,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,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-02-15 10:56:05,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,403 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-02-15 10:56:05,404 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:05,436 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:05,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:05,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:05,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:05,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:05,491 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-15 10:56:05,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:05,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:05,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:05,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:05,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:05,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 10:56:05,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:05,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:05,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:05,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:05,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:05,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:56:05,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:05,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:56:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:56:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:56:05,783 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-02-15 10:56:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:07,103 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-02-15 10:56:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:07,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-02-15 10:56:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:07,105 INFO L225 Difference]: With dead ends: 239 [2019-02-15 10:56:07,105 INFO L226 Difference]: Without dead ends: 230 [2019-02-15 10:56:07,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:56:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-15 10:56:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-02-15 10:56:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-15 10:56:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-02-15 10:56:08,179 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-02-15 10:56:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:08,179 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-02-15 10:56:08,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:56:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-02-15 10:56:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:56:08,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:08,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:08,180 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-15 10:56:08,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:08,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:08,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:08,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:08,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:08,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:08,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:08,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:56:08,263 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-02-15 10:56:08,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:08,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:08,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:08,265 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:08,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:08,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:08,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:08,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:08,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:08,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:08,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:08,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:56:08,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:56:08,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:56:08,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:56:08,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:08,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:08,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:08,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:08,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:08,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:08,391 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:56:08,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:56:08,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:08,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:08,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:08,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:08,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:56:08,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:08,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:08,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:56:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:08,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:08,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:08,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:56:08,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:08,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:56:08,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:56:08,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:56:08,570 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-02-15 10:56:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:09,786 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-02-15 10:56:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:56:09,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-02-15 10:56:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:09,787 INFO L225 Difference]: With dead ends: 236 [2019-02-15 10:56:09,787 INFO L226 Difference]: Without dead ends: 227 [2019-02-15 10:56:09,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:56:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-15 10:56:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-02-15 10:56:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-15 10:56:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-02-15 10:56:10,868 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-02-15 10:56:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:10,869 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-02-15 10:56:10,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:56:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-02-15 10:56:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:10,869 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:10,869 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:10,869 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-02-15 10:56:10,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:10,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:10,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:11,038 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-15 10:56:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:56:11,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:11,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:11,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:11,071 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-02-15 10:56:11,071 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:11,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:11,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:11,073 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:11,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:11,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:11,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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:11,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:11,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:11,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:11,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:11,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, 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-02-15 10:56:11,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:56:11,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:56:11,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,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, 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-02-15 10:56:11,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:11,183 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:56:11,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:56:11,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:11,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:11,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,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 33 treesize of output 57 [2019-02-15 10:56:11,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:11,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:56:11,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:11,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:56:11,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:11,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-02-15 10:56:11,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-15 10:56:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:11,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:11,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:11,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:56:11,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:11,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:56:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:56:11,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:11,439 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-02-15 10:56:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:12,700 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-02-15 10:56:12,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:56:12,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-15 10:56:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:12,702 INFO L225 Difference]: With dead ends: 236 [2019-02-15 10:56:12,702 INFO L226 Difference]: Without dead ends: 227 [2019-02-15 10:56:12,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:56:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-15 10:56:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-02-15 10:56:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-02-15 10:56:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-02-15 10:56:13,775 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-02-15 10:56:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:13,775 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-02-15 10:56:13,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:56:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-02-15 10:56:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:13,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:13,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:13,777 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-02-15 10:56:13,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:13,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:13,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:14,363 WARN L181 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-02-15 10:56:14,530 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2019-02-15 10:56:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:14,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:14,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:14,588 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:14,588 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 10:56:14,589 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:14,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:14,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:14,593 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:56:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:14,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:14,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:14,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:14,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:14,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:14,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:14,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:14,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,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, 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-02-15 10:56:14,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:14,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:14,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:14,808 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-02-15 10:56:14,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:56:14,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:14,936 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:14,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:14,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:14,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:14,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:14,992 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:56:15,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 10:56:15,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:15,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:15,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 10:56:15,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:15,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:15,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,198 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:15,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 10:56:15,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:15,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:15,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:15,295 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:15,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:56:15,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:15,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:15,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:15,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:15,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 10:56:15,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:15,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:56:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:56:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:56:15,445 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-02-15 10:56:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:17,530 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-02-15 10:56:17,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:56:17,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 10:56:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:17,531 INFO L225 Difference]: With dead ends: 326 [2019-02-15 10:56:17,531 INFO L226 Difference]: Without dead ends: 316 [2019-02-15 10:56:17,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:56:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-02-15 10:56:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-02-15 10:56:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-15 10:56:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-02-15 10:56:18,697 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-02-15 10:56:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:18,697 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-02-15 10:56:18,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:56:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-02-15 10:56:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:18,697 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:18,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:18,698 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-02-15 10:56:18,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:18,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:18,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:18,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:18,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:18,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:18,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:18,813 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 10:56:18,813 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:18,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:18,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:18,816 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:56:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:18,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:18,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:18,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:18,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:18,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:18,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:18,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:18,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 10:56:18,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:56:18,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:56:18,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:56:18,873 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:18,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:18,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:18,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:18,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:18,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:18,939 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:56:18,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:18,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 45 [2019-02-15 10:56:18,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:19,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:19,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:19,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,030 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:19,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:56:19,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:19,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:19,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:56:19,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:19,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 10:56:19,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:19,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:19,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:56:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:19,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:19,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:19,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:56:19,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:19,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:56:19,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:56:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:19,190 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-02-15 10:56:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:21,093 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-02-15 10:56:21,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:21,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 10:56:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:21,095 INFO L225 Difference]: With dead ends: 288 [2019-02-15 10:56:21,095 INFO L226 Difference]: Without dead ends: 279 [2019-02-15 10:56:21,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:56:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-15 10:56:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-02-15 10:56:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-02-15 10:56:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-02-15 10:56:22,668 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-02-15 10:56:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:22,668 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-02-15 10:56:22,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:56:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-02-15 10:56:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:22,669 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:22,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:22,669 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-15 10:56:22,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:22,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:22,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:22,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:22,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:56:22,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:22,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:22,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:22,858 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-15 10:56:22,858 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:22,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:22,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:22,861 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:56:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:22,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:22,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:22,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:22,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:22,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:22,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:22,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:56:22,881 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-02-15 10:56:22,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:22,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:56:22,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:22,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:22,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:56:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:22,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:22,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:22,903 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-02-15 10:56:22,904 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:22,924 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:22,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:22,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:22,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:22,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:22,972 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:56:23,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:56:23,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:23,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:23,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:23,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:56:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:23,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:23,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:56:23,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,126 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:23,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:23,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-15 10:56:23,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:23,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:23,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:56:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:23,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:23,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:56:23,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:23,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:56:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:56:23,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:23,242 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-02-15 10:56:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:25,185 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-02-15 10:56:25,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:56:25,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-15 10:56:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:25,187 INFO L225 Difference]: With dead ends: 277 [2019-02-15 10:56:25,187 INFO L226 Difference]: Without dead ends: 268 [2019-02-15 10:56:25,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:56:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-02-15 10:56:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-02-15 10:56:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-02-15 10:56:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-02-15 10:56:26,841 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-02-15 10:56:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:26,841 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-02-15 10:56:26,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:56:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-02-15 10:56:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:26,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:26,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:26,842 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-02-15 10:56:26,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:26,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:26,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:26,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:27,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:27,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:27,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:27,040 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-02-15 10:56:27,041 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:27,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:27,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:27,043 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 10:56:27,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:27,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:27,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:27,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:27,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:27,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:27,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:27,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:56:27,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,068 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-02-15 10:56:27,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:56:27,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:56:27,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,085 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-02-15 10:56:27,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,167 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:56:27,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:27,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:27,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:27,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,287 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:27,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:56:27,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:27,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:27,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:56:27,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:27,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,460 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:27,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:56:27,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:27,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:56:27,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:27,559 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:27,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-02-15 10:56:27,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:27,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:27,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:56:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:27,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:27,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:27,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 10:56:27,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:27,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:56:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:56:27,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:56:27,872 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-02-15 10:56:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:30,834 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-02-15 10:56:30,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:56:30,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 10:56:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:30,836 INFO L225 Difference]: With dead ends: 361 [2019-02-15 10:56:30,837 INFO L226 Difference]: Without dead ends: 356 [2019-02-15 10:56:30,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:56:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-02-15 10:56:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-02-15 10:56:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-02-15 10:56:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-02-15 10:56:32,551 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-02-15 10:56:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:32,552 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-02-15 10:56:32,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:56:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-02-15 10:56:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:32,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:32,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:32,553 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:32,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-02-15 10:56:32,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:32,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:32,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:32,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:32,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 10:56:32,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:32,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:32,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:32,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:32,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:32,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:32,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:32,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:32,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:56:32,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:32,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:32,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:32,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,876 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-02-15 10:56:32,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-15 10:56:32,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:56:32,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:32,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, 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-02-15 10:56:32,909 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,946 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:32,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,020 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:56:33,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:33,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:33,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:33,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:33,909 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-15 10:56:33,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:33,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,196 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:34,196 INFO L303 Elim1Store]: Index analysis took 284 ms [2019-02-15 10:56:34,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:56:34,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:34,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:34,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:34,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:34,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:56:34,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:35,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:35,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,079 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:35,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:56:35,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:35,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:35,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,168 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:35,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:35,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 10:56:35,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:35,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:35,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:56:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:35,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:35,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:35,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 10:56:35,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:35,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:56:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:56:35,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:56:35,347 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-02-15 10:56:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:38,192 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-02-15 10:56:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:56:38,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 10:56:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:38,194 INFO L225 Difference]: With dead ends: 357 [2019-02-15 10:56:38,194 INFO L226 Difference]: Without dead ends: 352 [2019-02-15 10:56:38,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:56:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-02-15 10:56:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-02-15 10:56:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-15 10:56:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-02-15 10:56:39,688 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-02-15 10:56:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:39,688 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-02-15 10:56:39,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:56:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-02-15 10:56:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:39,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:39,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:39,689 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:39,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:39,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-02-15 10:56:39,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:39,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:39,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:39,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:39,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:39,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:39,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:39,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:39,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:39,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:56:39,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:56:39,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:56:39,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:39,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:39,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:39,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,971 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-02-15 10:56:39,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:56:39,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:56:39,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:39,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, 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-02-15 10:56:40,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,080 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:56:40,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:40,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:40,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:40,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,199 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:40,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:56:40,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:40,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:40,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:56:40,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:40,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:40,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,373 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:40,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:56:40,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:40,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:40,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:40,464 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:40,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 99 [2019-02-15 10:56:40,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:40,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:40,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:40,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:40,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 10:56:40,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:40,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:56:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:56:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:56:40,652 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-02-15 10:56:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:42,913 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-02-15 10:56:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:56:42,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-02-15 10:56:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:42,915 INFO L225 Difference]: With dead ends: 260 [2019-02-15 10:56:42,915 INFO L226 Difference]: Without dead ends: 253 [2019-02-15 10:56:42,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:56:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-02-15 10:56:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-02-15 10:56:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-02-15 10:56:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-02-15 10:56:43,933 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-02-15 10:56:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:43,933 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-02-15 10:56:43,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:56:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-02-15 10:56:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:43,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:43,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:43,934 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:43,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-02-15 10:56:43,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:43,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:43,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:43,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:44,253 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-15 10:56:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:44,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:44,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:44,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:44,342 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 10:56:44,342 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:44,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:44,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:44,344 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:56:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:44,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:44,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:44,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:44,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:44,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:44,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:44,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:44,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:56:44,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:56:44,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:56:44,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,392 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-02-15 10:56:44,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,412 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:44,459 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:56:44,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:56:44,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:44,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:44,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:56:44,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:44,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:44,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,630 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:44,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:56:44,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:44,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:56:44,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:44,702 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:44,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:56:44,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:44,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:44,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:56:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:44,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:44,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:44,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:56:44,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:44,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:56:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:56:44,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:56:44,839 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-02-15 10:56:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:46,698 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-02-15 10:56:46,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:56:46,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 10:56:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:46,699 INFO L225 Difference]: With dead ends: 202 [2019-02-15 10:56:46,700 INFO L226 Difference]: Without dead ends: 195 [2019-02-15 10:56:46,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:56:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-15 10:56:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-02-15 10:56:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-15 10:56:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-02-15 10:56:47,940 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-02-15 10:56:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:47,940 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-02-15 10:56:47,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:56:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-02-15 10:56:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:47,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:47,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:47,941 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-02-15 10:56:47,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:47,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:47,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:47,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:48,084 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-02-15 10:56:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:56:48,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:48,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:48,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:48,232 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-15 10:56:48,233 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:48,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:48,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:48,234 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:56:48,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:48,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:48,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:48,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:48,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:48,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:48,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:48,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:48,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,303 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-02-15 10:56:48,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:56:48,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:48,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 10:56:48,519 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,597 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:56:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:48,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:48,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:48,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:56:48,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:48,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:48,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,812 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:48,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:56:48,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:48,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:48,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:48,904 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:48,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:56:48,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:48,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:48,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:56:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:48,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:49,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:49,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:56:49,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:49,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:56:49,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:56:49,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:56:49,052 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-02-15 10:56:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:50,928 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-02-15 10:56:50,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:50,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 10:56:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:50,929 INFO L225 Difference]: With dead ends: 199 [2019-02-15 10:56:50,929 INFO L226 Difference]: Without dead ends: 192 [2019-02-15 10:56:50,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:56:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-02-15 10:56:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-02-15 10:56:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-02-15 10:56:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-02-15 10:56:52,097 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-02-15 10:56:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:52,097 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-02-15 10:56:52,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:56:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-02-15 10:56:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:52,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:52,097 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:52,098 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:52,098 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-15 10:56:52,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:52,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:52,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:56:52,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:52,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:52,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:52,167 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-15 10:56:52,167 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:52,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:52,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:52,169 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:56:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:52,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:52,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:52,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:52,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:52,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:52,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:56:52,190 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-02-15 10:56:52,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:56:52,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:56:52,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,225 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-02-15 10:56:52,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:52,294 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-15 10:56:52,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:56:52,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:52,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:52,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:56:52,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:52,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:56:52,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:52,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:56:52,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:52,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:52,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-15 10:56:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:52,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:52,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:52,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:56:52,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:52,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:56:52,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:56:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:56:52,550 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-02-15 10:56:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:54,170 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-02-15 10:56:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:56:54,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-15 10:56:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:54,172 INFO L225 Difference]: With dead ends: 196 [2019-02-15 10:56:54,172 INFO L226 Difference]: Without dead ends: 187 [2019-02-15 10:56:54,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:56:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-15 10:56:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-02-15 10:56:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-15 10:56:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-02-15 10:56:55,560 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-02-15 10:56:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:55,560 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-02-15 10:56:55,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:56:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-02-15 10:56:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:55,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:55,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:55,561 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:55,561 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-15 10:56:55,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:55,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:56:55,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:55,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:55,673 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:56:55,673 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-15 10:56:55,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:55,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:55,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:55,675 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:56:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:55,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:55,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:55,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:55,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:55,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:55,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:55,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:56:55,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,695 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-02-15 10:56:55,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 10:56:55,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:56:55,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:56:55,727 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:55,807 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:56:55,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:56:55,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:55,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:55,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 10:56:55,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:55,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:55,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:56:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:55,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,007 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:56:56,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:56:56,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 10:56:56,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:56,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:56:56,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:56:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:56,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:56,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:56,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-15 10:56:56,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:56,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:56:56,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:56:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:56:56,152 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-02-15 10:56:56,720 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-02-15 10:56:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:58,435 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-02-15 10:56:58,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:56:58,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-15 10:56:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:58,436 INFO L225 Difference]: With dead ends: 203 [2019-02-15 10:56:58,436 INFO L226 Difference]: Without dead ends: 194 [2019-02-15 10:56:58,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:56:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-15 10:56:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-02-15 10:56:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-15 10:56:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-02-15 10:56:59,904 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-02-15 10:56:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:59,904 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-02-15 10:56:59,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:56:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-02-15 10:56:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:56:59,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:59,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:56:59,904 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-02-15 10:56:59,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:00,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:00,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:00,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:57:00,040 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-15 10:57:00,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:00,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:00,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:00,042 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:57:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:00,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:00,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:00,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:00,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:00,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:00,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:00,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:57:00,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:57:00,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:57:00,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:57:00,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,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, 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-02-15 10:57:00,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:00,184 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:00,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:00,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:00,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:00,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:00,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:00,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:00,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,401 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:00,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-02-15 10:57:00,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:00,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:00,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,504 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:00,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 10:57:00,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:00,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:00,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:00,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:00,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:57:00,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:00,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:57:00,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:57:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:57:00,647 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-02-15 10:57:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:03,182 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-02-15 10:57:03,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:03,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 10:57:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:03,183 INFO L225 Difference]: With dead ends: 269 [2019-02-15 10:57:03,183 INFO L226 Difference]: Without dead ends: 265 [2019-02-15 10:57:03,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:57:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-02-15 10:57:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-02-15 10:57:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-15 10:57:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-02-15 10:57:04,980 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-02-15 10:57:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:04,980 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-02-15 10:57:04,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:57:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-02-15 10:57:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:57:04,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:04,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:04,981 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-02-15 10:57:04,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:04,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:04,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:05,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:05,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:05,119 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:57:05,119 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-02-15 10:57:05,119 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:05,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:05,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:05,121 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:57:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:05,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:05,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:05,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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:05,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:05,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:05,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:05,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:05,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,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, 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-02-15 10:57:05,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:57:05,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,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, 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-02-15 10:57:05,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57: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, 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-02-15 10:57:05,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,263 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:05,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:05,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:05,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:05,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:05,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,474 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57: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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-02-15 10:57:05,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:05,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,578 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:05,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-02-15 10:57:05,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:05,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-02-15 10:57:05,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:05,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:05,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:57:05,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:05,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:57:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:57:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:57:05,717 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-02-15 10:57:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:08,238 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-02-15 10:57:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:08,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 10:57:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:08,240 INFO L225 Difference]: With dead ends: 253 [2019-02-15 10:57:08,240 INFO L226 Difference]: Without dead ends: 249 [2019-02-15 10:57:08,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:57:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-15 10:57:10,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-02-15 10:57:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-15 10:57:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-02-15 10:57:10,066 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-02-15 10:57:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:10,067 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-02-15 10:57:10,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:57:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-02-15 10:57:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:57:10,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:10,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:10,067 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-02-15 10:57:10,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:10,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:10,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:10,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:10,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:57:10,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:10,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:10,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:57:10,165 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-02-15 10:57:10,165 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:10,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:10,167 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:10,167 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:10,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:10,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:10,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:10,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:10,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:10,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:10,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:10,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,196 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-02-15 10:57:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:57:10,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:57:10,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,226 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-02-15 10:57:10,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:10,310 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:10,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:10,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:10,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:10,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:10,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:10,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:10,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:10,507 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:10,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 10:57:10,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:10,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:10,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:10,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:10,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-15 10:57:10,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:10,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:10,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:10,646 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-02-15 10:57:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:12,782 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-02-15 10:57:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:12,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-15 10:57:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:12,784 INFO L225 Difference]: With dead ends: 226 [2019-02-15 10:57:12,784 INFO L226 Difference]: Without dead ends: 217 [2019-02-15 10:57:12,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:57:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-02-15 10:57:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-02-15 10:57:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-15 10:57:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-02-15 10:57:14,592 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-02-15 10:57:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:14,592 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-02-15 10:57:14,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-02-15 10:57:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:57:14,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:14,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:14,593 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:14,593 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-02-15 10:57:14,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:14,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:14,821 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-15 10:57:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 10:57:14,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:14,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:14,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:14,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:14,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:14,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:14,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:14,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:14,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:57:14,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:14,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:14,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:57:14,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,966 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-02-15 10:57:14,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:57:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-15 10:57:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:14,987 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-02-15 10:57:14,987 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:15,067 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:15,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:15,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:15,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:15,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,183 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:15,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, 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-02-15 10:57:15,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:15,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:15,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-02-15 10:57:15,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:15,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:15,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:15,355 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:15,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:57:15,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:15,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:15,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:15,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:15,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:15,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:57:15,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:15,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:57:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:57:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:57:15,522 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-02-15 10:57:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:18,163 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-02-15 10:57:18,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:18,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 10:57:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:18,164 INFO L225 Difference]: With dead ends: 258 [2019-02-15 10:57:18,165 INFO L226 Difference]: Without dead ends: 251 [2019-02-15 10:57:18,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:57:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-02-15 10:57:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-02-15 10:57:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-15 10:57:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-02-15 10:57:19,974 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-02-15 10:57:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:19,974 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-02-15 10:57:19,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:57:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-02-15 10:57:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:57:19,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:19,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:19,975 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-02-15 10:57:19,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:19,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:19,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:19,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:19,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:20,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:20,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:20,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:20,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:20,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:20,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:20,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:20,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:57:20,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:20,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:20,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:57:20,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:57:20,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:57:20,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:57:20,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 10:57:20,252 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:20,321 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-15 10:57:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:57:20,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:20,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-15 10:57:20,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,428 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57: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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-15 10:57:20,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:20,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-15 10:57:20,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,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 35 treesize of output 61 [2019-02-15 10:57:20,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:20,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-15 10:57:20,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,555 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57: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 35 treesize of output 75 [2019-02-15 10:57:20,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:20,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-15 10:57:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:20,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:20,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:20,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:57:20,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:20,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:57:20,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:57:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:57:20,687 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-02-15 10:57:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:23,547 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-02-15 10:57:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:23,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 10:57:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:23,549 INFO L225 Difference]: With dead ends: 279 [2019-02-15 10:57:23,549 INFO L226 Difference]: Without dead ends: 272 [2019-02-15 10:57:23,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:57:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-15 10:57:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-02-15 10:57:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-15 10:57:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-02-15 10:57:25,600 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-02-15 10:57:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:25,600 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-02-15 10:57:25,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:57:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-02-15 10:57:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:57:25,600 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:25,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:25,601 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-02-15 10:57:25,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:25,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:25,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:25,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:25,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:25,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:25,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:25,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:25,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:25,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:25,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:25,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:57:25,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:25,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:25,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:57:25,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,865 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-02-15 10:57:25,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:57:25,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:25,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:57:25,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:25,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,015 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:26,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:26,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,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-02-15 10:57:26,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:26,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,143 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:26,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:57:26,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:26,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-15 10:57:26,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:26,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,347 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:26,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-02-15 10:57:26,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:26,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:26,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:26,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:57:26,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:26,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:57:26,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:57:26,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:57:26,517 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-02-15 10:57:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:29,281 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-02-15 10:57:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:29,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 10:57:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:29,283 INFO L225 Difference]: With dead ends: 256 [2019-02-15 10:57:29,283 INFO L226 Difference]: Without dead ends: 249 [2019-02-15 10:57:29,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:57:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-15 10:57:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-02-15 10:57:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-15 10:57:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-02-15 10:57:31,307 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-02-15 10:57:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:31,307 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-02-15 10:57:31,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:57:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-02-15 10:57:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:57:31,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:31,308 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:31,308 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-02-15 10:57:31,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:31,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:31,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:31,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:31,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 10:57:31,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:31,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:31,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:31,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:31,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:31,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:31,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:31,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:31,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:57:31,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:31,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:31,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 10:57:31,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-15 10:57:31,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 10:57:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:57:31,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-15 10:57:31,483 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:31,551 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-15 10:57:31,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:57:31,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:31,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-15 10:57:31,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,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 59 [2019-02-15 10:57:31,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:31,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-15 10:57:31,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,701 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:31,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:57:31,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:31,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-15 10:57:31,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-15 10:57:31,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:31,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-02-15 10:57:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:31,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:31,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:31,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 10:57:31,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:31,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:57:31,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:57:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:57:31,898 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-02-15 10:57:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:34,328 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-02-15 10:57:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:57:34,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-02-15 10:57:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:34,330 INFO L225 Difference]: With dead ends: 234 [2019-02-15 10:57:34,330 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 10:57:34,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:57:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 10:57:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-02-15 10:57:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 10:57:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-02-15 10:57:34,793 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-02-15 10:57:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:34,793 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-02-15 10:57:34,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:57:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-02-15 10:57:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:57:34,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:34,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:34,793 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-02-15 10:57:34,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:34,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:34,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:34,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:34,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:35,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-02-15 10:57:35,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:35,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:35,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 10:57:35,046 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 10:57:35,047 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:35,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:35,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:35,049 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 10:57:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:35,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:35,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:35,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:35,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:35,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:35,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:35,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:57:35,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,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, 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-02-15 10:57:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:57:35,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:35,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,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, 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-02-15 10:57:35,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,181 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:35,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:35,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:35,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:35,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,301 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:35,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 10:57:35,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:35,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:35,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:35,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:35,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:35,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,475 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:35,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-02-15 10:57:35,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,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-02-15 10:57:35,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:35,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,569 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:35,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-02-15 10:57:35,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:35,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:35,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:35,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:35,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 10:57:35,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:35,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:57:35,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:57:35,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:57:35,761 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-02-15 10:57:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:37,097 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-02-15 10:57:37,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:57:37,098 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-02-15 10:57:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:37,098 INFO L225 Difference]: With dead ends: 76 [2019-02-15 10:57:37,099 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 10:57:37,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-02-15 10:57:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 10:57:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-02-15 10:57:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-15 10:57:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-02-15 10:57:37,621 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-02-15 10:57:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:37,621 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-02-15 10:57:37,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:57:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-02-15 10:57:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:57:37,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:37,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:37,621 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-02-15 10:57:37,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:37,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:37,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:37,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:37,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:37,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:37,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:37,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:37,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:37,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:37,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:37,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:57:37,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:37,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:37,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:57:37,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,864 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-02-15 10:57:37,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-15 10:57:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:57:37,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,900 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-02-15 10:57:37,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,987 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:38,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:38,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:38,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:38,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:38,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:38,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:38,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:38,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:38,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,208 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:38,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-02-15 10:57:38,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:38,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:38,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:38,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,307 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:38,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:57:38,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:38,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:38,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:38,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,406 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:38,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:57:38,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:38,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:38,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:38,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:38,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:38,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 10:57:38,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:38,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:57:38,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:57:38,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:57:38,613 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-02-15 10:57:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:39,992 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-02-15 10:57:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:57:39,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-15 10:57:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:39,993 INFO L225 Difference]: With dead ends: 75 [2019-02-15 10:57:39,993 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 10:57:39,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:57:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 10:57:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-02-15 10:57:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:57:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-02-15 10:57:40,505 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-02-15 10:57:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:40,505 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-02-15 10:57:40,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:57:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-02-15 10:57:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:57:40,506 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:40,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:40,506 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-02-15 10:57:40,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:40,732 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-02-15 10:57:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:40,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:40,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:40,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:40,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:40,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:40,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:40,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:57:40,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:57:40,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:57:40,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:40,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:40,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-15 10:57:40,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,933 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-02-15 10:57:40,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,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-02-15 10:57:40,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,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-02-15 10:57:40,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,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-02-15 10:57:40,949 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,036 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:41,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 10:57:41,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:41,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:41,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 10:57:41,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:41,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:41,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,265 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:41,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-02-15 10:57:41,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:41,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:41,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,366 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:41,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-02-15 10:57:41,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:41,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:41,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,458 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:41,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 10:57:41,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:41,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:41,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:41,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:41,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 10:57:41,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:41,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:57:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:57:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:57:41,635 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-02-15 10:57:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:43,468 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-02-15 10:57:43,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:57:43,469 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-02-15 10:57:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:43,469 INFO L225 Difference]: With dead ends: 97 [2019-02-15 10:57:43,469 INFO L226 Difference]: Without dead ends: 84 [2019-02-15 10:57:43,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:57:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-15 10:57:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-02-15 10:57:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 10:57:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-02-15 10:57:44,265 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-02-15 10:57:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:44,265 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-02-15 10:57:44,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:57:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-02-15 10:57:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:57:44,265 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:44,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:57:44,266 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:44,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-02-15 10:57:44,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:44,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:44,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,404 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-02-15 10:57:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:57:44,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:44,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:44,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:44,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:44,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:44,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:44,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-15 10:57:44,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,699 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-02-15 10:57:44,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,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 23 treesize of output 37 [2019-02-15 10:57:44,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 10:57:44,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,730 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-02-15 10:57:44,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,816 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-15 10:57:44,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,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 36 treesize of output 72 [2019-02-15 10:57:44,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:44,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-15 10:57:44,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,946 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:44,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-15 10:57:44,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:44,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-02-15 10:57:45,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-02-15 10:57:45,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:45,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:45,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,169 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:45,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:57:45,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:45,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,260 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:45,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-15 10:57:45,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:45,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:57:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:45,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:45,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:45,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 10:57:45,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:45,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:57:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:57:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:57:45,441 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-02-15 10:57:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:46,989 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-02-15 10:57:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:57:46,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-15 10:57:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:46,990 INFO L225 Difference]: With dead ends: 67 [2019-02-15 10:57:46,990 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 10:57:46,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:57:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 10:57:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 10:57:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 10:57:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 10:57:46,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-02-15 10:57:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:46,991 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 10:57:46,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:57:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 10:57:46,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 10:57:46,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 10:57:47,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:47,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:47,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:47,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:48,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:49,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:50,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:50,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:50,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:50,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:50,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:50,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:55,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:55,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:57:56,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:01,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:01,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:01,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:03,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:03,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:07,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:07,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:07,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:08,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:11,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:21,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:22,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:22,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:22,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:22,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:22,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:28,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:41,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:48,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:49,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:50,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:50,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:57,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:57,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:57,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:57,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:57,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:58:57,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:06,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:06,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:10,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:10,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:10,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:10,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:10,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:10,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:16,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:59:59,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:00:12,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:00:12,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:00:12,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:00:33,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:00:33,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:00:33,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:00:37,659 WARN L181 SmtUtils]: Spent 2.84 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-02-15 11:04:30,326 WARN L181 SmtUtils]: Spent 3.88 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-02-15 11:04:30,330 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-02-15 11:04:30,331 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-02-15 11:04:30,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-02-15 11:04:30,331 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-02-15 11:04:30,332 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-02-15 11:04:30,332 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-02-15 11:04:30,349 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:04:30 BoogieIcfgContainer [2019-02-15 11:04:30,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 11:04:30,350 INFO L168 Benchmark]: Toolchain (without parser) took 712029.23 ms. Allocated memory was 140.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 106.4 MB in the beginning and 981.5 MB in the end (delta: -875.1 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-02-15 11:04:30,351 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 140.0 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:04:30,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.77 ms. Allocated memory is still 140.0 MB. Free memory was 106.2 MB in the beginning and 103.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:04:30,351 INFO L168 Benchmark]: Boogie Preprocessor took 21.10 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 102.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:04:30,351 INFO L168 Benchmark]: RCFGBuilder took 342.06 ms. Allocated memory is still 140.0 MB. Free memory was 102.7 MB in the beginning and 91.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:04:30,352 INFO L168 Benchmark]: TraceAbstraction took 711606.65 ms. Allocated memory was 140.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 91.5 MB in the beginning and 981.5 MB in the end (delta: -890.1 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-02-15 11:04:30,353 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 140.0 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.77 ms. Allocated memory is still 140.0 MB. Free memory was 106.2 MB in the beginning and 103.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.10 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 102.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.06 ms. Allocated memory is still 140.0 MB. Free memory was 102.7 MB in the beginning and 91.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 711606.65 ms. Allocated memory was 140.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 91.5 MB in the beginning and 981.5 MB in the end (delta: -890.1 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 711.4s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 140.7s AutomataDifference, 0.0s DeadEndRemovalTime, 403.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 61.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 59.5s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 170.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 232.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 100.6s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...