java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:53:20,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:53:20,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:53:20,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:53:20,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:53:20,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:53:20,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:53:20,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:53:20,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:53:20,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:53:20,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:53:20,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:53:20,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:53:20,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:53:20,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:53:20,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:53:20,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:53:20,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:53:20,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:53:20,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:53:20,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:53:20,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:53:20,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:53:20,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:53:20,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:53:20,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:53:20,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:53:20,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:53:20,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:53:20,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:53:20,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:53:20,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:53:20,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:53:20,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:53:20,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:53:20,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:53:20,134 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 [2018-12-24 13:53:20,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:53:20,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:53:20,157 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:53:20,157 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:53:20,157 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:53:20,158 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:53:20,158 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:53:20,158 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:53:20,158 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:53:20,158 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:53:20,158 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:53:20,162 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:53:20,162 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:53:20,162 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:53:20,163 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:53:20,163 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:53:20,163 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:53:20,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:53:20,164 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:53:20,164 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:53:20,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:53:20,165 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:53:20,165 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:53:20,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:53:20,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:53:20,165 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:53:20,166 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:53:20,166 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:53:20,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:53:20,166 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:53:20,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:53:20,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:53:20,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:53:20,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:53:20,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:53:20,168 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:53:20,169 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:53:20,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:53:20,169 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:53:20,169 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:53:20,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:53:20,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:53:20,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:53:20,217 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:53:20,217 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:53:20,218 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2018-12-24 13:53:20,218 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2018-12-24 13:53:20,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:53:20,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:53:20,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:53:20,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:53:20,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:53:20,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:53:20,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:53:20,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:53:20,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:53:20,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/1) ... [2018-12-24 13:53:20,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:53:20,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:53:20,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:53:20,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:53:20,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (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 [2018-12-24 13:53:20,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:53:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:53:20,631 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:53:20,631 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-24 13:53:20,632 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:53:20 BoogieIcfgContainer [2018-12-24 13:53:20,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:53:20,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:53:20,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:53:20,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:53:20,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:53:20" (1/2) ... [2018-12-24 13:53:20,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1068f905 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:53:20, skipping insertion in model container [2018-12-24 13:53:20,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:53:20" (2/2) ... [2018-12-24 13:53:20,640 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2018-12-24 13:53:20,649 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:53:20,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-24 13:53:20,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-24 13:53:20,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:53:20,702 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:53:20,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:53:20,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:53:20,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:53:20,704 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:53:20,704 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:53:20,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:53:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-24 13:53:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 13:53:20,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:20,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 13:53:20,733 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2018-12-24 13:53:20,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:20,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:20,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:20,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:53:20,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:53:20,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:53:20,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:53:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:53:20,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:53:20,962 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-12-24 13:53:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:21,226 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-12-24 13:53:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:53:21,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 13:53:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:21,241 INFO L225 Difference]: With dead ends: 21 [2018-12-24 13:53:21,241 INFO L226 Difference]: Without dead ends: 16 [2018-12-24 13:53:21,245 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 [2018-12-24 13:53:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-24 13:53:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-12-24 13:53:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 13:53:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-24 13:53:21,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2018-12-24 13:53:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:21,280 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-24 13:53:21,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:53:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-24 13:53:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:53:21,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:21,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:53:21,282 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2018-12-24 13:53:21,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:21,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:21,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:21,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:21,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:21,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:21,393 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:53:21,395 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2018-12-24 13:53:21,427 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:21,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:21,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:21,499 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:53:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:21,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:21,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:21,507 INFO 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 [2018-12-24 13:53:21,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:21,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:21,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:21,736 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-24 13:53:21,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:21,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:21,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:21,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:21,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:21,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:21,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:21,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:21,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:22,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:22,565 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-12-24 13:53:22,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:22,633 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,651 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:22,699 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:22,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:22,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:22,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:22,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:22,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:22,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:22,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:22,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:53:22,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:22,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:53:22,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:53:22,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:53:22,910 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2018-12-24 13:53:23,146 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-24 13:53:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:23,526 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2018-12-24 13:53:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:53:23,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:53:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:23,528 INFO L225 Difference]: With dead ends: 31 [2018-12-24 13:53:23,528 INFO L226 Difference]: Without dead ends: 28 [2018-12-24 13:53:23,530 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 [2018-12-24 13:53:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-24 13:53:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2018-12-24 13:53:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:53:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-12-24 13:53:23,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2018-12-24 13:53:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:23,536 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2018-12-24 13:53:23,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:53:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2018-12-24 13:53:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:53:23,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:23,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:53:23,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-12-24 13:53:23,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:23,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:23,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:23,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:23,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:53:23,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:53:23,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:53:23,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:53:23,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:53:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:53:23,571 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2018-12-24 13:53:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:23,646 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-24 13:53:23,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:53:23,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 13:53:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:23,648 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:53:23,648 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 13:53:23,649 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 [2018-12-24 13:53:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 13:53:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 13:53:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:53:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-12-24 13:53:23,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2018-12-24 13:53:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:23,653 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2018-12-24 13:53:23,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:53:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2018-12-24 13:53:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:53:23,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:23,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:53:23,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2018-12-24 13:53:23,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:23,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:23,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:23,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:23,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:23,726 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:53:23,726 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2018-12-24 13:53:23,728 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:23,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:23,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:23,736 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:53:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:23,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:23,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:23,737 INFO 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 [2018-12-24 13:53:23,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:23,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:23,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:23,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:23,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 18 treesize of output 24 [2018-12-24 13:53:23,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:23,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:23,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 20 treesize of output 34 [2018-12-24 13:53:23,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:53:23,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:23,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:23,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:23,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:23,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:23,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:53:23,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:23,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:23,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-24 13:53:23,949 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:23,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:23,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:23,978 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2018-12-24 13:53:24,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:24,015 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 [2018-12-24 13:53:24,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:24,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 13:53:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:24,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:24,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:53:24,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:53:24,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:53:24,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:53:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:53:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:53:24,122 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2018-12-24 13:53:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:24,236 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2018-12-24 13:53:24,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:53:24,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 13:53:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:24,237 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:53:24,238 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 13:53:24,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:53:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 13:53:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-24 13:53:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 13:53:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2018-12-24 13:53:24,244 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2018-12-24 13:53:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:24,245 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2018-12-24 13:53:24,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:53:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2018-12-24 13:53:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:53:24,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:24,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:53:24,246 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2018-12-24 13:53:24,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:24,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:24,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:24,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:24,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:24,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:24,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:24,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:53:24,433 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2018-12-24 13:53:24,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:24,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:24,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:24,439 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:53:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:24,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:24,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:24,439 INFO 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 [2018-12-24 13:53:24,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:24,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:24,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:24,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:24,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:53:24,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:24,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:24,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-24 13:53:24,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:24,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:24,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:24,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:53:24,595 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,649 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:24,689 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-24 13:53:24,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:24,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2018-12-24 13:53:24,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:24,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:24,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 13:53:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:24,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:24,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:24,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:53:24,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:24,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:53:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:53:24,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:53:24,812 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2018-12-24 13:53:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:24,950 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2018-12-24 13:53:24,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:53:24,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:53:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:24,951 INFO L225 Difference]: With dead ends: 32 [2018-12-24 13:53:24,951 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 13:53:24,952 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 [2018-12-24 13:53:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 13:53:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-24 13:53:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-24 13:53:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2018-12-24 13:53:24,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2018-12-24 13:53:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:24,959 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2018-12-24 13:53:24,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:53:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2018-12-24 13:53:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:53:24,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:24,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:53:24,960 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2018-12-24 13:53:24,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:24,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:24,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:24,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:24,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:25,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:25,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:25,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:53:25,070 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2018-12-24 13:53:25,072 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:25,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:25,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:25,080 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:53:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:25,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:25,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:25,081 INFO 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 [2018-12-24 13:53:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:25,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:25,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:25,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:25,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:25,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:25,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:25,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:25,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:25,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:25,295 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,330 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:25,385 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:25,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:25,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:25,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:25,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:25,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:53:25,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:53:25,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:53:25,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:53:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:53:25,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:53:25,491 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2018-12-24 13:53:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:25,527 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2018-12-24 13:53:25,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:53:25,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:53:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:25,529 INFO L225 Difference]: With dead ends: 22 [2018-12-24 13:53:25,530 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 13:53:25,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:53:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 13:53:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-24 13:53:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-24 13:53:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2018-12-24 13:53:25,536 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2018-12-24 13:53:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:25,537 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2018-12-24 13:53:25,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:53:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2018-12-24 13:53:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:53:25,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:25,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:53:25,538 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2018-12-24 13:53:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:25,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:25,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:25,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:25,614 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:53:25,614 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2018-12-24 13:53:25,616 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:25,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:25,620 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:25,621 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:25,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:25,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:25,622 INFO 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 [2018-12-24 13:53:25,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:25,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:25,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:25,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:25,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 18 treesize of output 24 [2018-12-24 13:53:25,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:25,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:25,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:25,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:25,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:25,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:25,948 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,986 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:25,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:26,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:26,020 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:26,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:26,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:26,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:26,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:26,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:26,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:26,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:26,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:26,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:26,442 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:26,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, 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 [2018-12-24 13:53:26,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:26,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. [2018-12-24 13:53:26,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2018-12-24 13:53:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:26,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:26,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:26,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:53:26,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:26,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:26,593 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2018-12-24 13:53:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:27,028 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2018-12-24 13:53:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:53:27,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:53:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:27,030 INFO L225 Difference]: With dead ends: 37 [2018-12-24 13:53:27,030 INFO L226 Difference]: Without dead ends: 36 [2018-12-24 13:53:27,030 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 [2018-12-24 13:53:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-24 13:53:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2018-12-24 13:53:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:53:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2018-12-24 13:53:27,037 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2018-12-24 13:53:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:27,037 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2018-12-24 13:53:27,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2018-12-24 13:53:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:53:27,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:27,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:53:27,038 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:27,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2018-12-24 13:53:27,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:27,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:27,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:27,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:27,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:27,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:53:27,151 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2018-12-24 13:53:27,154 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:27,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:27,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:27,160 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:27,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:27,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:27,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:27,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:27,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:27,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:27,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:27,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:27,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:27,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:27,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:27,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:27,420 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,449 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:27,500 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:27,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:27,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:27,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:27,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:27,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:27,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:27,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:27,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:27,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:27,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:27,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:53:27,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:27,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:27,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:27,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:27,773 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2018-12-24 13:53:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:28,123 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2018-12-24 13:53:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:53:28,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:53:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:28,125 INFO L225 Difference]: With dead ends: 46 [2018-12-24 13:53:28,125 INFO L226 Difference]: Without dead ends: 40 [2018-12-24 13:53:28,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:53:28,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-24 13:53:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2018-12-24 13:53:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 13:53:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2018-12-24 13:53:28,139 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2018-12-24 13:53:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:28,141 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2018-12-24 13:53:28,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2018-12-24 13:53:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:53:28,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:28,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:53:28,143 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2018-12-24 13:53:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:28,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:28,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:28,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:28,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:28,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:28,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:53:28,282 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2018-12-24 13:53:28,283 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:28,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:28,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:28,288 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:28,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:28,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:28,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:28,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:28,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:28,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:28,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:28,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 18 treesize of output 24 [2018-12-24 13:53:28,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:28,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:28,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:28,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:28,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:28,603 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:28,771 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:28,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-12-24 13:53:28,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:28,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:28,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:28,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-12-24 13:53:28,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:28,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:28,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2018-12-24 13:53:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:28,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:28,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:53:28,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:53:28,924 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2018-12-24 13:53:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:29,125 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2018-12-24 13:53:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:53:29,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:53:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:29,127 INFO L225 Difference]: With dead ends: 52 [2018-12-24 13:53:29,127 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 13:53:29,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:53:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 13:53:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2018-12-24 13:53:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 13:53:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2018-12-24 13:53:29,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2018-12-24 13:53:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:29,139 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2018-12-24 13:53:29,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2018-12-24 13:53:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:53:29,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:29,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:53:29,141 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2018-12-24 13:53:29,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:29,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:29,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:29,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:29,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:53:29,180 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2018-12-24 13:53:29,182 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:29,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:29,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:29,186 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:53:29,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:29,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:29,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:29,187 INFO 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 [2018-12-24 13:53:29,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:29,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:29,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:29,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:53:29,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-24 13:53:29,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:29,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:29,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:29,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:53:29,324 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:29,373 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-24 13:53:29,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,401 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 [2018-12-24 13:53:29,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:29,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 13:53:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:29,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:29,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:29,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:53:29,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:29,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:53:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:53:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:53:29,506 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2018-12-24 13:53:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:29,705 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2018-12-24 13:53:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:53:29,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:53:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:29,706 INFO L225 Difference]: With dead ends: 36 [2018-12-24 13:53:29,706 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:53:29,707 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 [2018-12-24 13:53:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:53:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-12-24 13:53:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 13:53:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2018-12-24 13:53:29,717 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2018-12-24 13:53:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:29,717 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2018-12-24 13:53:29,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:53:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2018-12-24 13:53:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:53:29,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:29,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:53:29,718 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2018-12-24 13:53:29,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:29,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:29,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:29,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:29,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:29,777 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:53:29,778 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2018-12-24 13:53:29,779 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:29,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:29,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:29,782 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:29,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:29,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:29,784 INFO 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 [2018-12-24 13:53:29,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:29,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:29,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:29,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:29,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:29,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:29,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:29,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:29,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:29,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:29,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:30,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:30,016 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,025 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:30,057 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:30,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:30,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:30,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:30,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:30,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:30,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:30,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:30,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:30,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:53:30,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:30,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:30,304 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2018-12-24 13:53:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:30,697 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2018-12-24 13:53:30,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:53:30,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:53:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:30,699 INFO L225 Difference]: With dead ends: 52 [2018-12-24 13:53:30,699 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 13:53:30,699 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 [2018-12-24 13:53:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 13:53:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2018-12-24 13:53:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:53:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2018-12-24 13:53:30,713 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2018-12-24 13:53:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:30,713 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2018-12-24 13:53:30,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2018-12-24 13:53:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:53:30,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:30,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:53:30,715 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:30,715 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2018-12-24 13:53:30,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:30,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:30,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:30,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:30,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:53:30,754 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2018-12-24 13:53:30,755 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:30,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:30,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:30,758 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:53:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:30,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:30,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:30,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:30,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:30,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:30,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:30,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:30,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:53:30,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-12-24 13:53:30,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-12-24 13:53:30,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-24 13:53:30,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-24 13:53:30,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:30,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:53:30,956 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,965 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,973 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:30,992 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2018-12-24 13:53:31,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-12-24 13:53:31,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:31,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2018-12-24 13:53:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:31,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:31,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:31,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:53:31,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:31,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:53:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:53:31,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:53:31,126 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2018-12-24 13:53:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:31,282 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2018-12-24 13:53:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:53:31,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:53:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:31,284 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:53:31,284 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 13:53:31,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:53:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 13:53:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-12-24 13:53:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-24 13:53:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2018-12-24 13:53:31,295 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2018-12-24 13:53:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:31,295 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2018-12-24 13:53:31,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:53:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2018-12-24 13:53:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:31,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:31,296 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 13:53:31,296 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2018-12-24 13:53:31,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:31,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:31,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:31,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:31,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:31,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:31,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:31,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:31,367 INFO 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 [2018-12-24 13:53:31,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:31,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:31,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:53:31,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:31,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:31,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:31,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:31,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:31,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:31,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:31,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:31,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:31,521 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,536 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,545 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:31,572 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:31,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:31,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:31,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:31,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:53:31,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:31,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2018-12-24 13:53:31,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:31,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:31,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:31,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:31,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:31,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:31,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:31,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:53:31,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:31,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:53:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:53:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:31,782 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2018-12-24 13:53:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:32,140 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2018-12-24 13:53:32,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:53:32,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-24 13:53:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:32,142 INFO L225 Difference]: With dead ends: 65 [2018-12-24 13:53:32,142 INFO L226 Difference]: Without dead ends: 60 [2018-12-24 13:53:32,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:53:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-24 13:53:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2018-12-24 13:53:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:53:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2018-12-24 13:53:32,153 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2018-12-24 13:53:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:32,153 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2018-12-24 13:53:32,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:53:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2018-12-24 13:53:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:32,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:32,154 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 13:53:32,154 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2018-12-24 13:53:32,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:32,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:32,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:32,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:32,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:32,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:32,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:32,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:32,263 INFO 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 [2018-12-24 13:53:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:32,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:32,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:53:32,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:32,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:32,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:32,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:32,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:32,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,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 22 treesize of output 45 [2018-12-24 13:53:32,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:32,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:32,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:32,449 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,464 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,473 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:32,492 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:32,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-24 13:53:32,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:32,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:32,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2018-12-24 13:53:32,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:32,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2018-12-24 13:53:32,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:32,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2018-12-24 13:53:32,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:32,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:32,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:32,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:32,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:32,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2018-12-24 13:53:32,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:32,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:53:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:53:32,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:53:32,760 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2018-12-24 13:53:32,976 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-24 13:53:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:33,229 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2018-12-24 13:53:33,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:53:33,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-24 13:53:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:33,231 INFO L225 Difference]: With dead ends: 53 [2018-12-24 13:53:33,231 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 13:53:33,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 13:53:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-12-24 13:53:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:53:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2018-12-24 13:53:33,243 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2018-12-24 13:53:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:33,243 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2018-12-24 13:53:33,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:53:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2018-12-24 13:53:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:33,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:33,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:33,244 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:33,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:33,244 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2018-12-24 13:53:33,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:33,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:33,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:33,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:33,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:33,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:33,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:33,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:53:33,324 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2018-12-24 13:53:33,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:33,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:33,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:33,329 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:33,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:33,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:33,330 INFO 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 [2018-12-24 13:53:33,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:33,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:33,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:33,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:33,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:33,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:33,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:33,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:33,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:33,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:33,518 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,542 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:33,591 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:33,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,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 45 [2018-12-24 13:53:33,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,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. [2018-12-24 13:53:33,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:33,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:33,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:33,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:33,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:33,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:33,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:33,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:33,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:53:33,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:33,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:33,842 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2018-12-24 13:53:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:34,070 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2018-12-24 13:53:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:53:34,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:53:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:34,072 INFO L225 Difference]: With dead ends: 54 [2018-12-24 13:53:34,072 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 13:53:34,073 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 [2018-12-24 13:53:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 13:53:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-12-24 13:53:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 13:53:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-12-24 13:53:34,085 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2018-12-24 13:53:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:34,085 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2018-12-24 13:53:34,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2018-12-24 13:53:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:34,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:34,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:34,086 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2018-12-24 13:53:34,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:34,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:34,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:34,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:34,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:34,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:34,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:34,211 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:53:34,211 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2018-12-24 13:53:34,213 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:34,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:34,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:34,217 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:53:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:34,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:34,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:34,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 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 [2018-12-24 13:53:34,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:34,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:34,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:34,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:34,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:34,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:34,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:53:34,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:53:34,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-24 13:53:34,342 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:34,383 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-12-24 13:53:34,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,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, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2018-12-24 13:53:34,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-12-24 13:53:34,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-24 13:53:34,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:108 [2018-12-24 13:53:34,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,634 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:34,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2018-12-24 13:53:34,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 44 [2018-12-24 13:53:34,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,747 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:34,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-12-24 13:53:34,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-24 13:53:34,786 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:105, output treesize:61 [2018-12-24 13:53:34,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 44 [2018-12-24 13:53:34,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,893 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:34,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-24 13:53:34,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:34,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-12-24 13:53:34,939 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:34,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-24 13:53:34,975 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2018-12-24 13:53:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:35,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:35,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:35,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2018-12-24 13:53:35,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:35,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:53:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:53:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:35,046 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2018-12-24 13:53:35,885 WARN L181 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2018-12-24 13:53:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:36,544 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2018-12-24 13:53:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 13:53:36,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:53:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:36,546 INFO L225 Difference]: With dead ends: 81 [2018-12-24 13:53:36,546 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 13:53:36,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:53:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 13:53:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2018-12-24 13:53:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 13:53:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2018-12-24 13:53:36,564 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2018-12-24 13:53:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:36,564 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2018-12-24 13:53:36,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:53:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2018-12-24 13:53:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:36,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:36,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:36,566 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2018-12-24 13:53:36,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:36,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:36,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:36,716 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-24 13:53:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:36,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:36,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:36,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:53:36,993 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2018-12-24 13:53:36,994 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:36,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:36,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:36,998 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:53:36,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:36,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:36,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:36,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 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 [2018-12-24 13:53:37,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:37,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:37,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:37,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:37,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:37,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:37,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:37,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:37,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:37,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:37,180 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,220 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:37,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:37,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:37,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:37,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,350 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:37,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:37,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:37,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2018-12-24 13:53:37,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:37,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:53:37,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:37,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. [2018-12-24 13:53:37,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-12-24 13:53:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:37,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:37,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:37,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:53:37,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:37,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:53:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:53:37,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:53:37,513 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2018-12-24 13:53:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:37,979 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2018-12-24 13:53:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:53:37,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:53:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:37,981 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:53:37,981 INFO L226 Difference]: Without dead ends: 64 [2018-12-24 13:53:37,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:53:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-24 13:53:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-12-24 13:53:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:53:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2018-12-24 13:53:37,997 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2018-12-24 13:53:37,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:37,997 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2018-12-24 13:53:37,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:53:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2018-12-24 13:53:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:37,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:37,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:37,999 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2018-12-24 13:53:37,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:38,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:38,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:38,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:38,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:38,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:53:38,073 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2018-12-24 13:53:38,074 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:38,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:38,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:38,078 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:38,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:38,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:38,079 INFO 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 [2018-12-24 13:53:38,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:38,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:38,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:38,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-24 13:53:38,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:38,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:38,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-24 13:53:38,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:38,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:38,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:38,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:38,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:53:38,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:38,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:38,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:38,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:38,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:53:38,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-12-24 13:53:38,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-12-24 13:53:38,302 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:38,540 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:38,647 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:38,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:38,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:38,740 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 13:53:39,134 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2018-12-24 13:53:39,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:39,174 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 [2018-12-24 13:53:39,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:39,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:39,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:53:39,502 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-24 13:53:39,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:39,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:39,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:39,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:39,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:39,613 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-12-24 13:53:39,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2018-12-24 13:53:39,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:39,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:39,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-24 13:53:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:40,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:40,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:40,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:53:40,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:40,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:40,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:53:40,324 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2018-12-24 13:53:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:40,595 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2018-12-24 13:53:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:53:40,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:53:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:40,597 INFO L225 Difference]: With dead ends: 62 [2018-12-24 13:53:40,597 INFO L226 Difference]: Without dead ends: 61 [2018-12-24 13:53:40,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-24 13:53:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2018-12-24 13:53:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-24 13:53:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2018-12-24 13:53:40,609 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2018-12-24 13:53:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:40,609 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2018-12-24 13:53:40,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2018-12-24 13:53:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:40,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:40,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:40,610 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:40,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2018-12-24 13:53:40,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:40,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:40,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:40,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:40,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:53:40,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:53:40,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:53:40,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:53:40,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:53:40,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:53:40,750 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2018-12-24 13:53:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:40,807 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2018-12-24 13:53:40,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:53:40,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:53:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:40,808 INFO L225 Difference]: With dead ends: 51 [2018-12-24 13:53:40,808 INFO L226 Difference]: Without dead ends: 46 [2018-12-24 13:53:40,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-24 13:53:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-24 13:53:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-12-24 13:53:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 13:53:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2018-12-24 13:53:40,824 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2018-12-24 13:53:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:40,824 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2018-12-24 13:53:40,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:53:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2018-12-24 13:53:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:40,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:40,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:40,825 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2018-12-24 13:53:40,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:40,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:40,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:40,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:40,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:40,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:40,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:40,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:40,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:40,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:40,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 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 [2018-12-24 13:53:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:40,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:40,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:53:40,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:40,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:40,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:40,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:40,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:40,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:40,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:40,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:40,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:40,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:40,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:40,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:41,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:41,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:41,432 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,443 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:41,471 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:41,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-12-24 13:53:41,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:41,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:41,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:41,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,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. [2018-12-24 13:53:41,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2018-12-24 13:53:41,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:41,685 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:41,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2018-12-24 13:53:41,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,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. [2018-12-24 13:53:41,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 13:53:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:41,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:41,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:41,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:53:41,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:41,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:53:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:53:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:41,818 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2018-12-24 13:53:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:42,575 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2018-12-24 13:53:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:53:42,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:53:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:42,577 INFO L225 Difference]: With dead ends: 90 [2018-12-24 13:53:42,577 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 13:53:42,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:53:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 13:53:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2018-12-24 13:53:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 13:53:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2018-12-24 13:53:42,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2018-12-24 13:53:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:42,599 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2018-12-24 13:53:42,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:53:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2018-12-24 13:53:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:42,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:42,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:42,600 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2018-12-24 13:53:42,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:42,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:42,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:42,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:42,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:42,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:42,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:42,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:53:42,658 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2018-12-24 13:53:42,659 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:42,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:42,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:42,662 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:42,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:42,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:42,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:42,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:42,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:42,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:42,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:42,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:42,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:42,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:42,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:42,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:42,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:42,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:42,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:42,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:42,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:42,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:42,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:42,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:42,873 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:42,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:42,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:42,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:43,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:43,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-12-24 13:53:43,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:43,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2018-12-24 13:53:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:43,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:43,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:43,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:53:43,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:43,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:43,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:43,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:53:43,287 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2018-12-24 13:53:43,465 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-24 13:53:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:43,598 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2018-12-24 13:53:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:53:43,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:53:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:43,600 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:53:43,600 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 13:53:43,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 13:53:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-12-24 13:53:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 13:53:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2018-12-24 13:53:43,625 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2018-12-24 13:53:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:43,626 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2018-12-24 13:53:43,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2018-12-24 13:53:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:43,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:43,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:43,626 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2018-12-24 13:53:43,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:43,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:43,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:43,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:43,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:43,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:43,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:43,670 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:53:43,670 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2018-12-24 13:53:43,671 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:43,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:43,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:43,675 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:43,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:43,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:43,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 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 [2018-12-24 13:53:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:43,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:43,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:43,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:43,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:43,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:43,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:43,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:43,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:43,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:43,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,923 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,935 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:43,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:43,953 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:44,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:44,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:44,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. [2018-12-24 13:53:44,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:44,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,242 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:44,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 53 [2018-12-24 13:53:44,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:44,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:44,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-12-24 13:53:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:44,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:44,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:44,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:53:44,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:44,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:53:44,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:53:44,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:53:44,315 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2018-12-24 13:53:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:44,540 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2018-12-24 13:53:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:53:44,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2018-12-24 13:53:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:44,542 INFO L225 Difference]: With dead ends: 63 [2018-12-24 13:53:44,543 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 13:53:44,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:53:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 13:53:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-12-24 13:53:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 13:53:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2018-12-24 13:53:44,561 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2018-12-24 13:53:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:44,562 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2018-12-24 13:53:44,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:53:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2018-12-24 13:53:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:53:44,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:44,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:53:44,563 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2018-12-24 13:53:44,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:44,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:44,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:44,798 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-24 13:53:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:44,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:44,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:44,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:44,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:44,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:44,811 INFO 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 [2018-12-24 13:53:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:44,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:44,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:53:44,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:44,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:44,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:44,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:44,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:44,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:44,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:44,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:44,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:44,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:44,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:44,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:44,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:44,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:44,972 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:44,981 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:45,028 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:45,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:45,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:45,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:45,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:53:45,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:45,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:45,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:45,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:45,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:53:45,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:45,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:45,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:45,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:45,160 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2018-12-24 13:53:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:45,356 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2018-12-24 13:53:45,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:53:45,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:53:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:45,358 INFO L225 Difference]: With dead ends: 86 [2018-12-24 13:53:45,358 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 13:53:45,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:53:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 13:53:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2018-12-24 13:53:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:53:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2018-12-24 13:53:45,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2018-12-24 13:53:45,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:45,382 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2018-12-24 13:53:45,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2018-12-24 13:53:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:45,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:45,383 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-24 13:53:45,383 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2018-12-24 13:53:45,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:45,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:45,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:45,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:53:45,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:45,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:45,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:45,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:45,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:45,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:45,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:45,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:45,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:45,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:45,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:45,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:45,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:45,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:45,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,618 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:45,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:45,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:45,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:45,649 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:45,699 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:45,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:45,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:45,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:45,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2018-12-24 13:53:45,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:45,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2018-12-24 13:53:45,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-12-24 13:53:45,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,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. [2018-12-24 13:53:45,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:45,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:45,851 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 [2018-12-24 13:53:45,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:45,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:45,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 13:53:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:45,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:45,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:45,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2018-12-24 13:53:45,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:45,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:53:45,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:53:45,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:53:45,956 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2018-12-24 13:53:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:46,441 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2018-12-24 13:53:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:53:46,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:53:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:46,443 INFO L225 Difference]: With dead ends: 96 [2018-12-24 13:53:46,443 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 13:53:46,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:53:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 13:53:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2018-12-24 13:53:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-24 13:53:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2018-12-24 13:53:46,477 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2018-12-24 13:53:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:46,477 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2018-12-24 13:53:46,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:53:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2018-12-24 13:53:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:46,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:46,478 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:53:46,478 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:46,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:46,478 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2018-12-24 13:53:46,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:46,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:46,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:46,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:46,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:46,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:46,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:46,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:46,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:46,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:46,581 INFO 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 [2018-12-24 13:53:46,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:46,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:46,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:46,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:46,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:46,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:46,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:46,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:46,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:46,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:46,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:46,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:46,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,781 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,791 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,800 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:46,822 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:46,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:46,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:46,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:46,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:53:46,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:46,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:46,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2018-12-24 13:53:46,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:46,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-12-24 13:53:46,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:47,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. [2018-12-24 13:53:47,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:47,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:47,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2018-12-24 13:53:47,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:47,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:47,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-12-24 13:53:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:47,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:47,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:47,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:53:47,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:47,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:53:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:53:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:53:47,238 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2018-12-24 13:53:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:47,754 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2018-12-24 13:53:47,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:53:47,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 13:53:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:47,756 INFO L225 Difference]: With dead ends: 107 [2018-12-24 13:53:47,756 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 13:53:47,756 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 [2018-12-24 13:53:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 13:53:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2018-12-24 13:53:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 13:53:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2018-12-24 13:53:47,789 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2018-12-24 13:53:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:47,789 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2018-12-24 13:53:47,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:53:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2018-12-24 13:53:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:47,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:47,790 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:53:47,790 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:47,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2018-12-24 13:53:47,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:47,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:47,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:47,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:48,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:48,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:48,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:48,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:48,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:48,184 INFO 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 [2018-12-24 13:53:48,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:48,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:48,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:48,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:48,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:48,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:48,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:48,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:48,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:48,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:48,343 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,353 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,359 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:48,378 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:48,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-24 13:53:48,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:48,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:48,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,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, 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 [2018-12-24 13:53:48,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:48,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:48,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,519 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 [2018-12-24 13:53:48,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:48,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2018-12-24 13:53:48,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:48,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2018-12-24 13:53:48,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:48,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:48,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-12-24 13:53:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:48,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:48,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:48,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:53:48,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:48,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:53:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:53:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:53:48,729 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2018-12-24 13:53:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:49,207 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2018-12-24 13:53:49,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:53:49,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 13:53:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:49,210 INFO L225 Difference]: With dead ends: 116 [2018-12-24 13:53:49,210 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 13:53:49,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:53:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 13:53:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2018-12-24 13:53:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 13:53:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2018-12-24 13:53:49,235 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2018-12-24 13:53:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:49,236 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2018-12-24 13:53:49,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:53:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2018-12-24 13:53:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:49,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:49,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:49,236 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2018-12-24 13:53:49,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:49,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:49,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:49,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:49,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:49,296 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:49,296 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2018-12-24 13:53:49,298 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:49,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:49,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:49,302 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:49,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:49,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:49,303 INFO 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 [2018-12-24 13:53:49,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:49,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:49,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:49,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:49,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:49,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:49,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:49,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:49,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:49,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:49,501 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:49,537 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:49,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,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, 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 [2018-12-24 13:53:49,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,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. [2018-12-24 13:53:49,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:49,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:49,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 59 [2018-12-24 13:53:49,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:49,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. [2018-12-24 13:53:49,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:49,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:49,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:49,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:53:49,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:49,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:49,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:49,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:53:49,682 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2018-12-24 13:53:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:49,949 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2018-12-24 13:53:49,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:53:49,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:53:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:49,950 INFO L225 Difference]: With dead ends: 72 [2018-12-24 13:53:49,950 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 13:53:49,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 13:53:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-12-24 13:53:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 13:53:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2018-12-24 13:53:49,976 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2018-12-24 13:53:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:49,976 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2018-12-24 13:53:49,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2018-12-24 13:53:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:49,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:49,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:49,978 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2018-12-24 13:53:49,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:49,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:50,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:50,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:50,039 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:50,039 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2018-12-24 13:53:50,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:50,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:50,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:50,043 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:53:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:50,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:50,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:50,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 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 [2018-12-24 13:53:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:50,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:50,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:50,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:50,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:50,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:50,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:50,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:50,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:50,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:50,218 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,228 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:50,255 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:50,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:50,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:50,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:50,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:50,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,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. [2018-12-24 13:53:50,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:50,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,441 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:50,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:50,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:50,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:50,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:50,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 13:53:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:50,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:50,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:50,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:53:50,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:50,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:53:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:53:50,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:50,529 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2018-12-24 13:53:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:50,881 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2018-12-24 13:53:50,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:53:50,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:53:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:50,883 INFO L225 Difference]: With dead ends: 77 [2018-12-24 13:53:50,883 INFO L226 Difference]: Without dead ends: 76 [2018-12-24 13:53:50,883 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 [2018-12-24 13:53:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-24 13:53:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2018-12-24 13:53:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 13:53:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2018-12-24 13:53:50,914 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2018-12-24 13:53:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:50,914 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2018-12-24 13:53:50,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:53:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2018-12-24 13:53:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:50,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:50,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:50,915 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:50,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:50,916 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2018-12-24 13:53:50,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:50,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:50,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:50,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:51,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:51,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:51,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:51,023 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2018-12-24 13:53:51,025 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:51,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:51,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:51,029 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:53:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:51,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:51,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:51,030 INFO 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 [2018-12-24 13:53:51,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:51,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:51,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:51,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:51,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:51,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,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 20 treesize of output 34 [2018-12-24 13:53:51,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:51,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:51,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:51,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:51,198 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,234 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:51,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:51,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:51,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:51,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:51,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,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. [2018-12-24 13:53:51,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:51,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:51,453 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:51,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:51,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:51,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 13:53:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:51,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:51,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:51,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:53:51,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:51,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:53:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:53:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:53:51,552 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2018-12-24 13:53:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:51,891 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2018-12-24 13:53:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:53:51,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:53:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:51,893 INFO L225 Difference]: With dead ends: 78 [2018-12-24 13:53:51,894 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 13:53:51,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:53:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 13:53:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2018-12-24 13:53:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 13:53:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2018-12-24 13:53:51,926 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2018-12-24 13:53:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:51,927 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2018-12-24 13:53:51,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:53:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2018-12-24 13:53:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:51,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:51,927 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:53:51,928 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2018-12-24 13:53:51,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:51,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:51,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:51,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:51,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:51,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:51,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:51,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:51,998 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2018-12-24 13:53:52,000 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:52,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:52,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:52,002 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:53:52,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:52,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:52,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:52,003 INFO 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 [2018-12-24 13:53:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:52,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:52,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:52,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:52,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:52,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:52,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:52,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:52,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:52,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:52,138 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,152 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,169 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:52,188 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:52,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:52,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:52,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:52,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,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, 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 [2018-12-24 13:53:52,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:52,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:52,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:52,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:52,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 13:53:52,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:52,364 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:52,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2018-12-24 13:53:52,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:52,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 13:53:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:52,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:52,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:52,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:53:52,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:52,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:53:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:53:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:53:52,484 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2018-12-24 13:53:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:52,963 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2018-12-24 13:53:52,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:53:52,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 13:53:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:52,965 INFO L225 Difference]: With dead ends: 95 [2018-12-24 13:53:52,965 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 13:53:52,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:53:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 13:53:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2018-12-24 13:53:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:53:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2018-12-24 13:53:53,006 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2018-12-24 13:53:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:53,006 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2018-12-24 13:53:53,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:53:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2018-12-24 13:53:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:53,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:53,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:53,007 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:53,007 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2018-12-24 13:53:53,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:53,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:53,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:53,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:53,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:53,149 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2018-12-24 13:53:53,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:53,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:53,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:53,155 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:53,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:53,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:53,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:53,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:53,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:53,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:53,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:53,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:53,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:53,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:53,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:53,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:53,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:53,502 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,520 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:53,547 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:53,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:53:53,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:53,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:53,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:53,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-12-24 13:53:53,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:53,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. [2018-12-24 13:53:53,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2018-12-24 13:53:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:53,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:53,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:53,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2018-12-24 13:53:53,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:53,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:53:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:53:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:53,694 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2018-12-24 13:53:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:54,590 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2018-12-24 13:53:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:53:54,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-24 13:53:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:54,592 INFO L225 Difference]: With dead ends: 90 [2018-12-24 13:53:54,592 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 13:53:54,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:53:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 13:53:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2018-12-24 13:53:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-24 13:53:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2018-12-24 13:53:54,636 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2018-12-24 13:53:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:54,636 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2018-12-24 13:53:54,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:53:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2018-12-24 13:53:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:54,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:54,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:54,637 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2018-12-24 13:53:54,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:54,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:54,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:54,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:54,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:54,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:54,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:54,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:54,712 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2018-12-24 13:53:54,713 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:54,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:54,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:54,716 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:53:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:54,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:54,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:54,717 INFO 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 [2018-12-24 13:53:54,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:54,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:54,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:54,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:54,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:54,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:54,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:53:54,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:53:54,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-24 13:53:54,833 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:54,851 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-12-24 13:53:54,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,879 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 [2018-12-24 13:53:54,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:54,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:53:54,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,905 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:54,906 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 36 [2018-12-24 13:53:54,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:54,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-12-24 13:53:54,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:54,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, 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 [2018-12-24 13:53:54,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:54,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:54,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-12-24 13:53:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:54,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:55,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:53:55,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:55,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:53:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:53:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:55,026 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2018-12-24 13:53:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:55,347 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2018-12-24 13:53:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:53:55,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:53:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:55,348 INFO L225 Difference]: With dead ends: 122 [2018-12-24 13:53:55,348 INFO L226 Difference]: Without dead ends: 121 [2018-12-24 13:53:55,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:53:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-24 13:53:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2018-12-24 13:53:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-24 13:53:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2018-12-24 13:53:55,402 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2018-12-24 13:53:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:55,402 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2018-12-24 13:53:55,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:53:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2018-12-24 13:53:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:55,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:55,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:55,403 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:55,404 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2018-12-24 13:53:55,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:55,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:55,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:55,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:55,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:55,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:55,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:55,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:55,568 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2018-12-24 13:53:55,569 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:55,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:55,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:55,573 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:55,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:55,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:55,573 INFO 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 [2018-12-24 13:53:55,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:55,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:55,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:55,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-24 13:53:55,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-24 13:53:55,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:53:55,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:55,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:53:55,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-12-24 13:53:55,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-12-24 13:53:55,726 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,743 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,751 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:55,776 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 13:53:55,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,805 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 [2018-12-24 13:53:55,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:55,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:53:55,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:55,833 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:55,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2018-12-24 13:53:55,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:55,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:55,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:53:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:55,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:55,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:55,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:53:55,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:55,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:55,898 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2018-12-24 13:53:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:56,118 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2018-12-24 13:53:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:53:56,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:53:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:56,120 INFO L225 Difference]: With dead ends: 113 [2018-12-24 13:53:56,120 INFO L226 Difference]: Without dead ends: 108 [2018-12-24 13:53:56,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-24 13:53:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-12-24 13:53:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 13:53:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2018-12-24 13:53:56,183 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2018-12-24 13:53:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:56,183 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2018-12-24 13:53:56,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2018-12-24 13:53:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:56,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:56,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:56,184 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2018-12-24 13:53:56,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:56,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:56,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:56,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:56,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:56,354 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-24 13:53:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:56,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:56,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:56,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:56,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:56,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:56,370 INFO 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 [2018-12-24 13:53:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:56,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:56,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:53:56,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:56,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:56,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:56,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:56,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:56,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:56,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:56,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:56,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:56,510 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,523 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:56,641 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:56,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:53:56,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:56,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:56,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,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 [2018-12-24 13:53:56,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:56,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:53:56,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,755 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:56,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:56,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2018-12-24 13:53:56,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:56,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:56,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 13:53:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:56,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:56,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:56,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:53:56,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:56,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:53:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:53:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:53:56,849 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2018-12-24 13:53:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:57,202 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2018-12-24 13:53:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:53:57,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-24 13:53:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:57,203 INFO L225 Difference]: With dead ends: 137 [2018-12-24 13:53:57,204 INFO L226 Difference]: Without dead ends: 136 [2018-12-24 13:53:57,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:53:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-24 13:53:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2018-12-24 13:53:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 13:53:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2018-12-24 13:53:57,256 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2018-12-24 13:53:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:57,256 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2018-12-24 13:53:57,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:53:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2018-12-24 13:53:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:57,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:57,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:57,258 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2018-12-24 13:53:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:57,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:57,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:57,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:57,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:57,572 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:57,572 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2018-12-24 13:53:57,573 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:57,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:57,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:57,576 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:53:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:57,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:57,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:57,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 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 [2018-12-24 13:53:57,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:57,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:57,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:57,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-24 13:53:57,664 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 17 treesize of output 19 [2018-12-24 13:53:57,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:57,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:57,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:57,870 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-12-24 13:53:57,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2018-12-24 13:53:57,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:57,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:57,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:57,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:57,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:53:58,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-12-24 13:53:58,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:53:58,005 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,016 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:58,045 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2018-12-24 13:53:58,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,110 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 [2018-12-24 13:53:58,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-24 13:53:58,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,189 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 [2018-12-24 13:53:58,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:58,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-12-24 13:53:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:58,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:58,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:58,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:53:58,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:58,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:53:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:53:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:53:58,249 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2018-12-24 13:53:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:58,451 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2018-12-24 13:53:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:53:58,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:53:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:58,454 INFO L225 Difference]: With dead ends: 110 [2018-12-24 13:53:58,454 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 13:53:58,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:53:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 13:53:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2018-12-24 13:53:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-24 13:53:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2018-12-24 13:53:58,508 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2018-12-24 13:53:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:58,508 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2018-12-24 13:53:58,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:53:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2018-12-24 13:53:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:58,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:58,509 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:53:58,509 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:58,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2018-12-24 13:53:58,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:58,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:58,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:58,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:58,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:53:58,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:58,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:58,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:58,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:58,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:58,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:58,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:58,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:58,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:53:58,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:58,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:58,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:58,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 18 treesize of output 24 [2018-12-24 13:53:58,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:58,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:58,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:58,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:53:58,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:53:58,823 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,839 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:58,857 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:53:58,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-12-24 13:53:58,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:58,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:53:58,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:58,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:53:58,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:58,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:58,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2018-12-24 13:53:59,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,043 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:53:59,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2018-12-24 13:53:59,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:59,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:53:59,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-12-24 13:53:59,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,130 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 [2018-12-24 13:53:59,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:59,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. [2018-12-24 13:53:59,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 13:53:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:59,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:59,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2018-12-24 13:53:59,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:59,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:53:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:53:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:53:59,257 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2018-12-24 13:53:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:59,695 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2018-12-24 13:53:59,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:53:59,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 13:53:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:59,698 INFO L225 Difference]: With dead ends: 124 [2018-12-24 13:53:59,698 INFO L226 Difference]: Without dead ends: 116 [2018-12-24 13:53:59,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:53:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-24 13:53:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-12-24 13:53:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 13:53:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2018-12-24 13:53:59,752 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2018-12-24 13:53:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:59,753 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2018-12-24 13:53:59,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:53:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2018-12-24 13:53:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:53:59,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:59,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:53:59,753 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2018-12-24 13:53:59,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:59,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:59,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:59,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:59,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:59,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:53:59,834 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2018-12-24 13:53:59,836 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:53:59,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:53:59,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:53:59,838 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 13:53:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:59,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:53:59,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:59,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:59,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:59,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:59,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:59,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:53:59,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:53:59,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:53:59,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:53:59,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:59,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:59,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:59,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:59,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:53:59,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:53:59,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:00,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:00,040 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,049 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,058 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,076 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:00,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:00,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:00,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:00,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-12-24 13:54:00,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:00,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2018-12-24 13:54:00,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,204 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:00,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:00,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:00,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 13:54:00,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:00,266 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:00,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:00,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:00,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. [2018-12-24 13:54:00,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2018-12-24 13:54:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:00,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:00,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:00,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:54:00,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:00,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:54:00,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:54:00,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:54:00,388 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2018-12-24 13:54:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:00,966 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2018-12-24 13:54:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:54:00,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:54:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:00,968 INFO L225 Difference]: With dead ends: 137 [2018-12-24 13:54:00,969 INFO L226 Difference]: Without dead ends: 136 [2018-12-24 13:54:00,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:54:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-24 13:54:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2018-12-24 13:54:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 13:54:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2018-12-24 13:54:01,044 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2018-12-24 13:54:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:01,045 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2018-12-24 13:54:01,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:54:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2018-12-24 13:54:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:54:01,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:01,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:54:01,046 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:01,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2018-12-24 13:54:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:01,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:01,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:01,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:01,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:01,269 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-24 13:54:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:01,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:01,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:01,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:01,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:01,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:01,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:54:01,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:01,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:01,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:54:01,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:01,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:01,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:01,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:01,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:01,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:01,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:01,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:01,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:01,645 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,653 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,681 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:01,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:01,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:01,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:01,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,755 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:01,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:54:01,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:01,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2018-12-24 13:54:01,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:01,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,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. [2018-12-24 13:54:01,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-12-24 13:54:01,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,861 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:01,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:01,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:01,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:01,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:01,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2018-12-24 13:54:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:01,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:01,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:01,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:54:01,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:01,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:54:01,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:54:01,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:54:01,976 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2018-12-24 13:54:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:02,598 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2018-12-24 13:54:02,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:02,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:54:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:02,602 INFO L225 Difference]: With dead ends: 172 [2018-12-24 13:54:02,602 INFO L226 Difference]: Without dead ends: 167 [2018-12-24 13:54:02,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:54:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-24 13:54:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2018-12-24 13:54:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-24 13:54:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2018-12-24 13:54:02,687 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2018-12-24 13:54:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:02,687 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2018-12-24 13:54:02,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:54:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2018-12-24 13:54:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:54:02,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:02,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:54:02,688 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2018-12-24 13:54:02,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:02,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:02,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:02,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:03,051 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-24 13:54:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:03,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:03,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:03,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:03,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:03,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:03,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 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 [2018-12-24 13:54:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:03,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:03,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:03,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:03,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:03,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:03,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:03,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:03,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:03,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:03,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:03,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:03,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,278 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,287 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,313 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:03,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-12-24 13:54:03,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:03,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:03,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,391 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:03,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, 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 [2018-12-24 13:54:03,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:03,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2018-12-24 13:54:03,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2018-12-24 13:54:03,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:03,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-12-24 13:54:03,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:03,491 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:03,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:03,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:03,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. [2018-12-24 13:54:03,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2018-12-24 13:54:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:03,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:03,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:03,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:54:03,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:03,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:54:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:54:03,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:54:03,607 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2018-12-24 13:54:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:04,101 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2018-12-24 13:54:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:04,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:54:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:04,103 INFO L225 Difference]: With dead ends: 140 [2018-12-24 13:54:04,103 INFO L226 Difference]: Without dead ends: 135 [2018-12-24 13:54:04,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:54:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-24 13:54:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2018-12-24 13:54:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-24 13:54:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2018-12-24 13:54:04,163 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2018-12-24 13:54:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:04,163 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2018-12-24 13:54:04,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:54:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2018-12-24 13:54:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:04,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:04,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:04,164 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2018-12-24 13:54:04,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:04,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:04,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:04,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:04,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:04,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:04,323 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:54:04,324 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2018-12-24 13:54:04,324 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:04,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:04,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:04,329 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:54:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:04,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:04,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:04,330 INFO 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 [2018-12-24 13:54:04,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:04,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:04,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:04,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:04,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:04,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:04,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:04,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:04,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:04,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:04,506 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,515 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,543 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:04,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:54:04,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:04,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:04,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-12-24 13:54:04,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:04,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:54:04,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,662 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:04,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:04,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:04,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:04,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2018-12-24 13:54:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:04,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:04,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:04,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:54:04,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:04,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:54:04,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:54:04,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:54:04,754 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2018-12-24 13:54:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:05,192 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2018-12-24 13:54:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:05,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:54:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:05,194 INFO L225 Difference]: With dead ends: 77 [2018-12-24 13:54:05,194 INFO L226 Difference]: Without dead ends: 76 [2018-12-24 13:54:05,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:54:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-24 13:54:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-12-24 13:54:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-24 13:54:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2018-12-24 13:54:05,267 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2018-12-24 13:54:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:05,267 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2018-12-24 13:54:05,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:54:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2018-12-24 13:54:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:05,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:05,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:05,268 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:05,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2018-12-24 13:54:05,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:05,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:05,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:05,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:05,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:05,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:54:05,378 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2018-12-24 13:54:05,379 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:05,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:05,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:05,384 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 13:54:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:05,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:05,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:05,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:54:05,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:05,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:05,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:05,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:05,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:05,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:05,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:05,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:05,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:05,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:05,573 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,582 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,609 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:05,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,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, 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 [2018-12-24 13:54:05,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,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. [2018-12-24 13:54:05,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:05,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-12-24 13:54:05,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:05,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:54:05,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,727 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:05,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:05,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,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. [2018-12-24 13:54:05,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 13:54:05,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,779 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:05,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:05,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:05,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:05,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:05,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2018-12-24 13:54:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:05,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:05,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:05,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:54:05,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:05,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:54:05,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:54:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:54:05,888 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2018-12-24 13:54:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:06,419 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2018-12-24 13:54:06,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:06,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:54:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:06,420 INFO L225 Difference]: With dead ends: 86 [2018-12-24 13:54:06,420 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 13:54:06,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:54:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 13:54:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2018-12-24 13:54:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 13:54:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2018-12-24 13:54:06,495 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2018-12-24 13:54:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:06,495 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2018-12-24 13:54:06,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:54:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2018-12-24 13:54:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:06,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:06,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:06,496 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:06,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2018-12-24 13:54:06,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:06,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:06,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:06,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:06,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:06,782 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:54:06,782 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2018-12-24 13:54:06,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:06,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:06,786 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:06,786 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:54:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:06,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:06,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:06,787 INFO 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 [2018-12-24 13:54:06,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:06,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:06,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:06,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:06,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:54:06,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-12-24 13:54:06,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-24 13:54:06,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:06,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:06,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:06,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:06,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. [2018-12-24 13:54:06,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2018-12-24 13:54:06,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:54:06,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 13:54:06,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-24 13:54:06,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2018-12-24 13:54:06,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-12-24 13:54:06,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:06,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:06,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:06,926 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:06,927 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 23 treesize of output 28 [2018-12-24 13:54:06,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:06,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:06,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2018-12-24 13:54:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:06,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:06,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:54:06,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2018-12-24 13:54:06,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:54:06,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 13:54:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 13:54:06,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:54:06,987 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2018-12-24 13:54:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:07,216 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2018-12-24 13:54:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:54:07,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-24 13:54:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:07,218 INFO L225 Difference]: With dead ends: 115 [2018-12-24 13:54:07,218 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 13:54:07,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:54:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 13:54:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2018-12-24 13:54:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-24 13:54:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2018-12-24 13:54:07,356 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2018-12-24 13:54:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:07,357 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2018-12-24 13:54:07,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 13:54:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2018-12-24 13:54:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:07,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:07,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:07,358 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2018-12-24 13:54:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:07,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:07,749 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-12-24 13:54:07,944 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-24 13:54:08,127 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-12-24 13:54:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:08,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:08,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:08,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:08,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:08,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:08,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 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 [2018-12-24 13:54:08,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:08,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:08,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:54:08,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:08,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:08,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:08,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:08,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:08,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:08,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:08,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:08,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:08,311 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,346 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:08,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:54:08,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:08,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:08,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:08,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, 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 [2018-12-24 13:54:08,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:08,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2018-12-24 13:54:08,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:08,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,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. [2018-12-24 13:54:08,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2018-12-24 13:54:08,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:08,581 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:08,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, 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 [2018-12-24 13:54:08,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:08,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:08,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2018-12-24 13:54:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:08,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:08,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:08,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:54:08,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:08,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:54:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:54:08,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:54:08,696 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2018-12-24 13:54:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:09,355 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2018-12-24 13:54:09,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:09,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-24 13:54:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:09,356 INFO L225 Difference]: With dead ends: 104 [2018-12-24 13:54:09,356 INFO L226 Difference]: Without dead ends: 103 [2018-12-24 13:54:09,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:54:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-24 13:54:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2018-12-24 13:54:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 13:54:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2018-12-24 13:54:09,442 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2018-12-24 13:54:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:09,442 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2018-12-24 13:54:09,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:54:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2018-12-24 13:54:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:09,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:09,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:09,443 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2018-12-24 13:54:09,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:09,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:09,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:09,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:09,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:09,512 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:54:09,512 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2018-12-24 13:54:09,513 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:09,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:09,515 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:09,515 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:54:09,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:09,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:09,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 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 [2018-12-24 13:54:09,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:09,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:09,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:09,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:09,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:54:09,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-12-24 13:54:09,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-12-24 13:54:09,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,587 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,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 26 treesize of output 25 [2018-12-24 13:54:09,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,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 22 treesize of output 38 [2018-12-24 13:54:09,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:54:09,654 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,662 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:09,688 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 13:54:09,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,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, 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 [2018-12-24 13:54:09,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:09,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:54:09,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:54:09,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:09,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2018-12-24 13:54:09,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,782 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:09,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:09,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2018-12-24 13:54:09,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:09,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:09,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-12-24 13:54:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:09,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:09,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:09,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:54:09,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:09,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:54:09,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:54:09,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:54:09,873 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2018-12-24 13:54:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:10,275 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2018-12-24 13:54:10,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:54:10,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:54:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:10,276 INFO L225 Difference]: With dead ends: 68 [2018-12-24 13:54:10,276 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 13:54:10,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:54:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 13:54:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-12-24 13:54:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 13:54:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2018-12-24 13:54:10,403 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2018-12-24 13:54:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:10,404 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2018-12-24 13:54:10,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:54:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2018-12-24 13:54:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:10,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:10,404 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-24 13:54:10,404 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:10,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2018-12-24 13:54:10,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:10,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:10,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:10,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:10,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:54:10,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:54:10,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:54:10,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:54:10,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:54:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:54:10,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:54:10,456 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2018-12-24 13:54:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:10,594 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2018-12-24 13:54:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:54:10,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-24 13:54:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:10,595 INFO L225 Difference]: With dead ends: 54 [2018-12-24 13:54:10,595 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 13:54:10,596 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 [2018-12-24 13:54:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 13:54:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-24 13:54:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 13:54:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2018-12-24 13:54:10,695 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2018-12-24 13:54:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:10,695 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2018-12-24 13:54:10,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:54:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2018-12-24 13:54:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:10,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:10,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:10,696 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2018-12-24 13:54:10,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:10,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:10,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:10,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:10,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:10,838 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-24 13:54:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:10,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:10,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:10,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:54:10,876 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2018-12-24 13:54:10,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:10,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:10,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:10,880 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:54:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:10,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:10,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:10,881 INFO 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 [2018-12-24 13:54:10,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:10,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:10,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:10,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:10,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:10,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:10,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:10,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:10,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:10,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:10,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:10,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:10,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:10,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:10,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:11,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:11,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:11,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:11,050 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,285 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:11,394 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:11,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:54:11,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:11,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:11,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:11,638 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-12-24 13:54:11,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:11,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:11,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:11,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2018-12-24 13:54:11,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:11,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-12-24 13:54:11,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:12,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2018-12-24 13:54:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:12,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:12,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:54:12,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:12,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:54:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:54:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:54:12,085 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2018-12-24 13:54:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:12,477 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2018-12-24 13:54:12,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:54:12,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:54:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:12,478 INFO L225 Difference]: With dead ends: 78 [2018-12-24 13:54:12,478 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 13:54:12,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:54:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 13:54:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2018-12-24 13:54:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 13:54:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2018-12-24 13:54:12,595 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2018-12-24 13:54:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:12,595 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2018-12-24 13:54:12,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:54:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2018-12-24 13:54:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:12,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:12,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:12,596 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2018-12-24 13:54:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:12,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:12,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:12,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:12,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:54:12,733 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2018-12-24 13:54:12,734 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:12,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:12,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:12,737 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:54:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:12,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:12,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:12,737 INFO 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 [2018-12-24 13:54:12,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:12,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:12,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:12,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:12,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:12,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:12,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:12,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:12,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:12,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:12,878 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,892 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,901 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,908 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:12,927 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:12,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:12,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:12,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:12,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:12,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:12,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2018-12-24 13:54:12,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:13,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:13,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-12-24 13:54:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:13,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:13,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:13,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:54:13,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:13,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:54:13,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:54:13,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:54:13,075 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2018-12-24 13:54:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:13,567 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2018-12-24 13:54:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:54:13,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-24 13:54:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:13,568 INFO L225 Difference]: With dead ends: 64 [2018-12-24 13:54:13,568 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 13:54:13,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:54:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 13:54:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-24 13:54:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 13:54:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2018-12-24 13:54:13,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2018-12-24 13:54:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:13,681 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2018-12-24 13:54:13,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:54:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2018-12-24 13:54:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:13,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:13,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:13,681 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2018-12-24 13:54:13,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:13,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:13,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:13,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:13,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:13,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:13,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:13,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:13,834 INFO 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 [2018-12-24 13:54:13,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:13,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:13,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:54:13,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:13,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:13,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 26 treesize of output 25 [2018-12-24 13:54:13,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:13,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:13,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-24 13:54:13,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:13,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:13,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:13,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:13,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:54:13,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:13,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:13,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:13,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:13,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:54:13,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-12-24 13:54:13,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-12-24 13:54:13,973 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:13,985 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:13,993 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:14,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:14,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:14,017 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2018-12-24 13:54:14,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:54:14,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:14,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:14,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:54:14,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-24 13:54:14,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:14,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:14,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2018-12-24 13:54:14,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:14,116 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2018-12-24 13:54:14,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:14,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:14,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2018-12-24 13:54:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:14,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:14,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:14,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:54:14,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:14,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:54:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:54:14,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:54:14,202 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2018-12-24 13:54:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:16,720 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2018-12-24 13:54:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:54:16,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:54:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:16,722 INFO L225 Difference]: With dead ends: 76 [2018-12-24 13:54:16,722 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 13:54:16,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:54:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 13:54:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-12-24 13:54:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 13:54:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2018-12-24 13:54:16,864 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2018-12-24 13:54:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:16,864 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2018-12-24 13:54:16,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:54:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2018-12-24 13:54:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:54:16,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:16,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:16,865 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2018-12-24 13:54:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:16,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:16,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:16,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:16,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:16,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:54:16,983 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2018-12-24 13:54:16,984 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:16,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:16,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:16,987 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:54:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:16,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:16,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:16,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 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 [2018-12-24 13:54:16,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:16,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:17,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:17,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-24 13:54:17,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-12-24 13:54:17,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2018-12-24 13:54:17,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:17,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:54:17,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-12-24 13:54:17,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:54:17,068 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,079 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:17,105 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2018-12-24 13:54:17,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:54:17,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 13:54:17,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:17,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-12-24 13:54:17,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,195 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:17,195 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 [2018-12-24 13:54:17,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:17,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-12-24 13:54:17,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:17,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:17,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2018-12-24 13:54:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:17,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:17,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:17,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2018-12-24 13:54:17,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:17,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:54:17,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:54:17,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:54:17,313 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2018-12-24 13:54:17,867 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-12-24 13:54:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:18,442 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2018-12-24 13:54:18,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:18,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:54:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:18,444 INFO L225 Difference]: With dead ends: 90 [2018-12-24 13:54:18,444 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 13:54:18,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:54:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 13:54:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-12-24 13:54:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-24 13:54:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2018-12-24 13:54:18,653 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2018-12-24 13:54:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:18,653 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2018-12-24 13:54:18,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:54:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2018-12-24 13:54:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:54:18,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:18,654 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:18,654 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2018-12-24 13:54:18,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:18,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:18,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:18,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:18,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:18,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:18,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:18,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:54:18,814 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2018-12-24 13:54:18,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:18,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:18,817 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:18,817 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:54:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:18,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:18,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:18,818 INFO 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 [2018-12-24 13:54:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:18,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:18,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:18,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 18 treesize of output 24 [2018-12-24 13:54:18,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:18,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:18,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:18,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:18,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:18,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:18,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:18,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:18,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:19,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:19,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:19,015 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:19,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:19,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:19,042 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:19,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2018-12-24 13:54:19,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:19,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:19,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:19,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:19,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:19,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:19,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:54:19,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:19,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2018-12-24 13:54:19,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:19,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:19,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2018-12-24 13:54:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:19,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:19,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:19,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2018-12-24 13:54:19,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:19,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:54:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:54:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:54:19,259 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2018-12-24 13:54:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:20,090 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2018-12-24 13:54:20,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 13:54:20,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-24 13:54:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:20,092 INFO L225 Difference]: With dead ends: 118 [2018-12-24 13:54:20,092 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 13:54:20,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:54:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 13:54:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2018-12-24 13:54:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-24 13:54:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2018-12-24 13:54:20,341 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2018-12-24 13:54:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:20,341 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2018-12-24 13:54:20,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:54:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2018-12-24 13:54:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:54:20,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:20,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:20,342 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2018-12-24 13:54:20,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:20,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:20,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:20,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:20,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:20,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:20,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:20,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:54:20,451 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2018-12-24 13:54:20,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:20,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:20,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:20,455 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-24 13:54:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:20,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:20,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:20,455 INFO 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 [2018-12-24 13:54:20,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:20,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:20,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:20,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:20,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:20,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:20,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:20,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:20,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:20,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:20,629 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,639 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,666 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:20,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:20,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:20,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:20,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-12-24 13:54:20,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:20,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:54:20,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,929 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:20,929 INFO L303 Elim1Store]: Index analysis took 145 ms [2018-12-24 13:54:20,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2018-12-24 13:54:20,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:20,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:20,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-12-24 13:54:20,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,980 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:20,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:20,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:20,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:21,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:21,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2018-12-24 13:54:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:21,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:21,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:21,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2018-12-24 13:54:21,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:21,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:54:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:54:21,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:54:21,091 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2018-12-24 13:54:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:21,989 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2018-12-24 13:54:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 13:54:21,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-24 13:54:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:21,997 INFO L225 Difference]: With dead ends: 124 [2018-12-24 13:54:21,997 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 13:54:21,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:54:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 13:54:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2018-12-24 13:54:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:54:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2018-12-24 13:54:22,320 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2018-12-24 13:54:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:22,320 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2018-12-24 13:54:22,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:54:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2018-12-24 13:54:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:54:22,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:22,321 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:22,321 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:22,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2018-12-24 13:54:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:22,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:22,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:54:22,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:22,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:22,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:54:22,392 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2018-12-24 13:54:22,393 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:22,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:22,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:22,396 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:54:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:22,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:22,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:22,396 INFO 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 [2018-12-24 13:54:22,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:22,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:22,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:22,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 15 treesize of output 18 [2018-12-24 13:54:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:54:22,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-12-24 13:54:22,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-24 13:54:22,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-24 13:54:22,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-12-24 13:54:22,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2018-12-24 13:54:22,494 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:22,519 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2018-12-24 13:54:22,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:54:22,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 13:54:22,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-24 13:54:22,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2018-12-24 13:54:22,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,610 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 [2018-12-24 13:54:22,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-12-24 13:54:22,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:22,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2018-12-24 13:54:22,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,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, 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 [2018-12-24 13:54:22,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:22,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-12-24 13:54:22,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:22,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:22,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2018-12-24 13:54:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:22,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:22,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:22,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:54:22,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:22,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:54:22,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:54:22,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:54:22,827 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2018-12-24 13:54:23,116 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-24 13:54:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:23,637 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2018-12-24 13:54:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:54:23,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 13:54:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:23,638 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:54:23,638 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 13:54:23,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:54:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 13:54:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-24 13:54:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-24 13:54:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2018-12-24 13:54:23,974 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2018-12-24 13:54:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:23,974 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2018-12-24 13:54:23,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:54:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2018-12-24 13:54:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:54:23,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:23,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:23,976 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:23,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2018-12-24 13:54:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:23,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:23,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:24,124 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-24 13:54:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:54:24,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:24,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:24,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:24,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:24,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:24,208 INFO 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 [2018-12-24 13:54:24,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:24,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:24,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:54:24,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:24,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:24,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:24,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-24 13:54:24,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-12-24 13:54:24,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-12-24 13:54:24,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-24 13:54:24,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-24 13:54:24,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:54:24,337 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,346 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,355 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,371 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2018-12-24 13:54:24,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2018-12-24 13:54:24,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 13:54:24,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:24,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2018-12-24 13:54:24,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2018-12-24 13:54:24,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,699 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:24,699 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 30 treesize of output 34 [2018-12-24 13:54:24,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:24,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2018-12-24 13:54:24,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,828 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:24,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2018-12-24 13:54:24,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-24 13:54:24,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:24,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2018-12-24 13:54:24,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-12-24 13:54:24,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:24,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:24,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:25,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:25,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:25,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:25,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:25,004 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:25,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2018-12-24 13:54:25,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:25,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-24 13:54:25,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2018-12-24 13:54:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:25,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:25,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:25,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2018-12-24 13:54:25,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:25,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:54:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:54:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:54:25,149 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2018-12-24 13:54:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:26,499 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2018-12-24 13:54:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 13:54:26,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-24 13:54:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:26,500 INFO L225 Difference]: With dead ends: 186 [2018-12-24 13:54:26,500 INFO L226 Difference]: Without dead ends: 177 [2018-12-24 13:54:26,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:54:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-24 13:54:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2018-12-24 13:54:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-24 13:54:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2018-12-24 13:54:26,934 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2018-12-24 13:54:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:26,934 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2018-12-24 13:54:26,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:54:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2018-12-24 13:54:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:54:26,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:26,935 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:26,935 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:26,935 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2018-12-24 13:54:26,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:26,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:26,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:54:27,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:27,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:27,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:54:27,050 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2018-12-24 13:54:27,052 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:27,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:27,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:27,054 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:54:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:27,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:27,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:27,055 INFO 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 [2018-12-24 13:54:27,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:27,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:27,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:27,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:27,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:27,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:27,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:27,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:27,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:27,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:27,218 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,248 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:27,274 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:27,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,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, 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 [2018-12-24 13:54:27,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:27,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:27,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:27,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:27,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-24 13:54:27,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,399 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:27,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2018-12-24 13:54:27,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:27,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-12-24 13:54:27,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:27,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 89 [2018-12-24 13:54:27,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:27,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:27,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-12-24 13:54:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:27,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:27,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:27,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:54:27,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:27,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:54:27,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:54:27,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:54:27,568 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2018-12-24 13:54:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:28,362 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2018-12-24 13:54:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:28,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-24 13:54:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:28,367 INFO L225 Difference]: With dead ends: 110 [2018-12-24 13:54:28,367 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 13:54:28,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:54:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 13:54:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2018-12-24 13:54:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 13:54:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2018-12-24 13:54:28,501 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2018-12-24 13:54:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:28,501 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2018-12-24 13:54:28,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:54:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2018-12-24 13:54:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:54:28,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:28,501 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:54:28,502 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2018-12-24 13:54:28,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:28,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-24 13:54:28,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:28,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:28,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:28,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:28,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:28,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:54:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:28,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:28,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:28,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:28,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:28,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-24 13:54:28,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-24 13:54:28,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-24 13:54:28,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-24 13:54:28,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-24 13:54:28,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-24 13:54:28,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-12-24 13:54:28,757 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,771 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,807 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-12-24 13:54:28,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-12-24 13:54:28,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:28,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-24 13:54:28,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:28,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:28,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2018-12-24 13:54:28,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,931 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:28,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2018-12-24 13:54:28,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:28,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2018-12-24 13:54:28,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:54:28,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:28,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:54:28,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:29,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. [2018-12-24 13:54:29,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2018-12-24 13:54:29,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:29,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:29,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:29,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:29,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:29,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:29,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:29,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2018-12-24 13:54:29,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:29,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 13:54:29,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2018-12-24 13:54:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:29,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:29,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:29,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2018-12-24 13:54:29,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:29,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:54:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:54:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:54:29,198 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2018-12-24 13:54:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:29,690 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2018-12-24 13:54:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:54:29,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-24 13:54:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:29,691 INFO L225 Difference]: With dead ends: 32 [2018-12-24 13:54:29,691 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:54:29,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:54:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:54:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:54:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:54:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:54:29,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-12-24 13:54:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:29,693 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:54:29,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:54:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:54:29,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:54:29,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:54:29,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:29,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:30,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:31,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:31,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:31,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:31,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:31,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:35,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:35,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:35,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:35,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:54:40,985 WARN L181 SmtUtils]: Spent 11.28 s on a formula simplification. DAG size of input: 1487 DAG size of output: 1019 [2018-12-24 13:54:55,214 WARN L181 SmtUtils]: Spent 14.22 s on a formula simplification. DAG size of input: 964 DAG size of output: 85 [2018-12-24 13:54:55,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:54:55,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse20 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse15 (- 1))))) (let ((.cse19 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse7 (select .cse20 ULTIMATE.start_main_p1))) (let ((.cse16 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse11 (<= 1 .cse7)) (.cse14 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse22 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse17 1))) (.cse21 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse19 1)))) (let ((.cse4 (<= (+ (select .cse21 ULTIMATE.start_main_p4) 1) 0)) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse5 (<= .cse15 0)) (.cse18 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse3 (= 0 (select .cse22 ULTIMATE.start_main_p2))) (.cse12 (= 0 (select .cse20 ULTIMATE.start_main_p2))) (.cse9 (and .cse0 .cse11 .cse14)) (.cse1 (= 0 (select .cse22 ULTIMATE.start_main_p1))) (.cse2 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse16 (- 1)))) (.cse6 (<= (+ (select .cse21 ULTIMATE.start_main_p2) 1) 0)) (.cse13 (select .cse20 ULTIMATE.start_main_p3))) (or (and (and .cse0 .cse1 (= 0 (select .cse2 ULTIMATE.start_main_p3)) .cse3) .cse4) (let ((.cse10 (= 0 .cse13))) (or (and .cse5 (and (or (and .cse6 (= 0 .cse7) .cse8) (and .cse6 .cse9)) .cse10)) (and (and .cse10 .cse11 .cse12 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) .cse4))) (and .cse14 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse15 0) (<= .cse16 0) (= .cse17 0) .cse8 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse18 (<= 0 .cse19)) (and .cse5 (and (or (and .cse14 .cse0 .cse1 .cse18 .cse3) (or (and .cse12 .cse9) (and .cse6 (and .cse1 .cse14)) (and (<= 1 (select .cse2 ULTIMATE.start_main_p1)) .cse6))) (<= 1 .cse13))))))))) [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2018-12-24 13:54:55,218 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-12-24 13:54:55,236 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:54:55 BoogieIcfgContainer [2018-12-24 13:54:55,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:54:55,237 INFO L168 Benchmark]: Toolchain (without parser) took 94980.91 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-24 13:54:55,237 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:54:55,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:54:55,238 INFO L168 Benchmark]: Boogie Preprocessor took 28.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:54:55,238 INFO L168 Benchmark]: RCFGBuilder took 282.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:54:55,238 INFO L168 Benchmark]: TraceAbstraction took 94602.90 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-24 13:54:55,240 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 282.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94602.90 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || (#memory_int[p4] <= 0 && (((#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4))) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3]) || ((((0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1])) || (#memory_int[p4] <= 0 && (((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) || ((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && !(p1 == p4))) || (1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0)) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 94.5s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 25.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9083 SolverSat, 820 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 397 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4094942593 FormulaSimplificationTreeSizeReduction, 11.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 37002537 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91495 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...