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-1de736e-m [2019-02-15 10:51:02,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:51:02,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:51:02,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:51:02,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:51:02,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:51:02,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:51:02,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:51:02,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:51:02,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:51:02,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:51:02,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:51:02,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:51:02,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:51:02,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:51:02,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:51:02,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:51:02,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:51:02,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:51:02,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:51:02,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:51:02,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:51:02,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:51:02,326 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:51:02,326 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:51:02,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:51:02,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:51:02,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:51:02,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:51:02,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:51:02,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:51:02,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:51:02,338 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:51:02,338 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:51:02,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:51:02,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:51:02,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:51:02,362 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:51:02,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:51:02,365 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:51:02,365 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:51:02,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:51:02,369 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:51:02,369 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:51:02,369 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:51:02,369 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:51:02,369 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:51:02,370 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:51:02,370 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:51:02,370 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:51:02,370 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:51:02,371 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:51:02,371 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:51:02,372 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:51:02,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:51:02,372 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:51:02,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:51:02,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:51:02,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:51:02,373 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:51:02,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:51:02,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:51:02,373 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:51:02,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:51:02,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:51:02,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:51:02,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:51:02,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:51:02,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:51:02,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:51:02,377 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:51:02,377 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:51:02,377 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:51:02,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:51:02,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:51:02,378 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:51:02,378 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:51:02,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:51:02,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:51:02,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:51:02,439 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:51:02,439 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:51:02,440 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 [2019-02-15 10:51:02,440 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-02-15 10:51:02,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:51:02,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:51:02,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:51:02,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:51:02,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:51:02,506 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,520 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:51:02,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:51:02,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:51:02,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:51:02,562 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,562 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,563 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,564 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,570 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,573 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,578 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 15.02 10:51:02" (1/1) ... [2019-02-15 10:51:02,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:51:02,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:51:02,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:51:02,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:51:02,586 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 15.02 10:51:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:51:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:51:02,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:51:03,038 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:51:03,038 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-15 10:51:03,040 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:51:03 BoogieIcfgContainer [2019-02-15 10:51:03,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:51:03,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:51:03,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:51:03,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:51:03,044 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 15.02 10:51:02" (1/2) ... [2019-02-15 10:51:03,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41976fe5 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:51:03, skipping insertion in model container [2019-02-15 10:51:03,045 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 15.02 10:51:03" (2/2) ... [2019-02-15 10:51:03,047 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-02-15 10:51:03,055 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:51:03,063 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-15 10:51:03,076 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-15 10:51:03,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:51:03,106 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:51:03,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:51:03,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:51:03,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:51:03,107 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:51:03,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:51:03,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:51:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-15 10:51:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:51:03,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:03,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:51:03,133 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-15 10:51:03,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:03,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:03,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:03,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:03,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:51:03,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:51:03,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:51:03,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:51:03,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:51:03,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:51:03,385 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-15 10:51:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:03,555 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-15 10:51:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:51:03,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:51:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:03,571 INFO L225 Difference]: With dead ends: 21 [2019-02-15 10:51:03,572 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 10:51:03,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:51:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 10:51:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-15 10:51:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 10:51:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-15 10:51:03,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-15 10:51:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:03,613 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-15 10:51:03,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:51:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-15 10:51:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:51:03,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:03,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:51:03,615 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-15 10:51:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:03,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:03,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:03,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:03,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:03,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:03,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:51:03,847 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-15 10:51:03,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:03,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:03,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:03,995 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. [2019-02-15 10:51:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:04,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:04,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:04,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:04,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:04,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:04,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:04,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:04,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:04,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,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 [2019-02-15 10:51:04,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:04,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:04,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:04,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:04,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:04,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:04,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:04,945 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-15 10:51:04,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:04,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:04,963 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:04,982 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:04,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:05,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:05,040 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:05,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:05,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:05,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:05,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:05,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:05,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:05,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:05,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:51:05,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:05,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:51:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:51:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:51:05,276 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-15 10:51:05,598 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-02-15 10:51:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:05,835 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-15 10:51:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:51:05,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:51:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:05,837 INFO L225 Difference]: With dead ends: 31 [2019-02-15 10:51:05,838 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 10:51:05,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:51:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 10:51:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-15 10:51:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:51:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-15 10:51:05,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-15 10:51:05,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:05,844 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-15 10:51:05,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:51:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-15 10:51:05,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:51:05,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:05,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:51:05,846 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:05,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:05,846 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-15 10:51:05,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:05,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:05,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:05,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:05,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:05,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:51:05,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:51:05,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:51:05,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:51:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:51:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:51:05,878 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-15 10:51:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:05,915 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-15 10:51:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:51:05,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:51:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:05,917 INFO L225 Difference]: With dead ends: 15 [2019-02-15 10:51:05,918 INFO L226 Difference]: Without dead ends: 14 [2019-02-15 10:51:05,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:51:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-15 10:51:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-15 10:51:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:51:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-15 10:51:05,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-15 10:51:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:05,923 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-15 10:51:05,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:51:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-15 10:51:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:51:05,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:05,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:51:05,924 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-15 10:51:05,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:05,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:05,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:06,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:06,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:06,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:51:06,054 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-15 10:51:06,056 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:06,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:06,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:06,064 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. [2019-02-15 10:51:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:06,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:06,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:06,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:06,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:06,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:06,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:06,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:06,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:06,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:06,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:51:06,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,280 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 [2019-02-15 10:51:06,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,327 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 [2019-02-15 10:51:06,328 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:06,361 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-02-15 10:51:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:51:06,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:06,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:06,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:06,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:51:06,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:51:06,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:51:06,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:51:06,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:51:06,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:51:06,471 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-15 10:51:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:06,559 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-15 10:51:06,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:51:06,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:51:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:06,561 INFO L225 Difference]: With dead ends: 18 [2019-02-15 10:51:06,561 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:51:06,562 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 [2019-02-15 10:51:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:51:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-15 10:51:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:51:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-15 10:51:06,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-15 10:51:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:06,568 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-15 10:51:06,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:51:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-15 10:51:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:51:06,569 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:06,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:51:06,570 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:06,570 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-15 10:51:06,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:06,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:06,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:06,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:06,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:06,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:06,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:51:06,687 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-15 10:51:06,688 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:06,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:06,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:06,694 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. [2019-02-15 10:51:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:06,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:06,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:06,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:06,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:06,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:06,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:06,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,747 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 [2019-02-15 10:51:06,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,795 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 [2019-02-15 10:51:06,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,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, 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 [2019-02-15 10:51:06,832 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 [2019-02-15 10:51:06,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:06,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:51:06,858 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,906 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:06,947 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-15 10:51:06,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:06,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:51:06,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:06,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:07,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:07,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:07,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:07,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:51:07,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:07,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:51:07,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:51:07,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:51:07,061 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-15 10:51:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:07,252 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-15 10:51:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:51:07,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:51:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:07,254 INFO L225 Difference]: With dead ends: 32 [2019-02-15 10:51:07,254 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 10:51:07,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:51:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 10:51:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-15 10:51:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 10:51:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-15 10:51:07,262 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-15 10:51:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:07,263 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-15 10:51:07,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:51:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-15 10:51:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:51:07,264 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:07,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:51:07,264 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-15 10:51:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:07,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:07,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:07,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:07,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:07,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:51:07,373 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-15 10:51:07,376 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:07,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:07,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:07,388 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. [2019-02-15 10:51:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:07,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:07,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:07,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:07,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:07,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:07,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:07,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:07,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:07,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:07,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,599 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 [2019-02-15 10:51:07,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:07,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, 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 [2019-02-15 10:51:07,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:07,630 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,668 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,676 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:07,728 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:07,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:07,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:07,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:07,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:07,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:07,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:07,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:51:07,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:51:07,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:51:07,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:51:07,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:51:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:51:07,841 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-15 10:51:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:07,882 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-15 10:51:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:51:07,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:51:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:07,883 INFO L225 Difference]: With dead ends: 22 [2019-02-15 10:51:07,883 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 10:51:07,884 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 [2019-02-15 10:51:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 10:51:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-15 10:51:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 10:51:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-15 10:51:07,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-15 10:51:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:07,891 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-15 10:51:07,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:51:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-15 10:51:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:51:07,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:07,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:51:07,892 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-15 10:51:07,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:07,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:07,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:07,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:07,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:07,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:07,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:07,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:51:07,966 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-15 10:51:07,967 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:07,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:07,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:07,971 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. [2019-02-15 10:51:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:07,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:07,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:07,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:07,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:07,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:07,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:08,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:08,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:08,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:08,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:08,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:08,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:08,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:08,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,274 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:08,303 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:08,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,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 45 [2019-02-15 10:51:08,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:08,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:08,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:08,773 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:08,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:51:08,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:08,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:08,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-15 10:51:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:08,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:51:08,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:08,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:08,892 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-15 10:51:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:09,245 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-15 10:51:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:51:09,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:51:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:09,247 INFO L225 Difference]: With dead ends: 37 [2019-02-15 10:51:09,247 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 10:51:09,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 10:51:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-15 10:51:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:51:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-15 10:51:09,254 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-15 10:51:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:09,254 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-15 10:51:09,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-15 10:51:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:51:09,255 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:09,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:51:09,255 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-15 10:51:09,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:09,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:09,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:09,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:09,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:09,393 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:51:09,393 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-15 10:51:09,395 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:09,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:09,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:09,400 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. [2019-02-15 10:51:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:09,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:09,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:09,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:09,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:09,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:09,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:09,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:09,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:09,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:09,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:09,640 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 [2019-02-15 10:51:09,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:09,653 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,689 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:09,736 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:09,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:09,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,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. [2019-02-15 10:51:09,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:09,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:09,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:51:09,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:09,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. [2019-02-15 10:51:09,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:09,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:09,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:09,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:51:09,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:09,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:09,996 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-15 10:51:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:10,505 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-02-15 10:51:10,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:51:10,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:51:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:10,507 INFO L225 Difference]: With dead ends: 46 [2019-02-15 10:51:10,507 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 10:51:10,507 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 [2019-02-15 10:51:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 10:51:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-15 10:51:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 10:51:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-15 10:51:10,522 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-15 10:51:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:10,523 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-15 10:51:10,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-15 10:51:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:51:10,524 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:10,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:51:10,524 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-15 10:51:10,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:10,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:10,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:10,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:10,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:10,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:10,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:51:10,655 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-15 10:51:10,657 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:10,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:10,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:10,661 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. [2019-02-15 10:51:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:10,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:10,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:10,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:10,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:10,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:10,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:10,698 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 [2019-02-15 10:51:10,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:10,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:10,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:10,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:10,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:10,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:10,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:10,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:10,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,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 [2019-02-15 10:51:10,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:10,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:10,993 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,004 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:11,033 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:11,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:11,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:11,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:11,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:51:11,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:11,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 10:51:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:11,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:11,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:11,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:51:11,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:11,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:11,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:51:11,178 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-15 10:51:11,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:11,375 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-02-15 10:51:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:11,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:51:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:11,377 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:51:11,377 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 10:51:11,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:51:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 10:51:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-02-15 10:51:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:51:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-02-15 10:51:11,385 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-02-15 10:51:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:11,386 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-02-15 10:51:11,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-02-15 10:51:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:51:11,387 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:11,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:51:11,387 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-15 10:51:11,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:11,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:11,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:11,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:11,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:11,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:51:11,440 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-15 10:51:11,442 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:11,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:11,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:11,447 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. [2019-02-15 10:51:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:11,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:11,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:11,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:11,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:11,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:11,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,487 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 [2019-02-15 10:51:11,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,508 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 [2019-02-15 10:51:11,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,524 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 [2019-02-15 10:51:11,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:11,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:11,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:51:11,537 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:11,578 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-15 10:51:11,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:11,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:51:11,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:11,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:11,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:11,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:11,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:51:11,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:11,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:51:11,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:51:11,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:51:11,729 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-02-15 10:51:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:11,912 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-02-15 10:51:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:51:11,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:51:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:11,914 INFO L225 Difference]: With dead ends: 36 [2019-02-15 10:51:11,914 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:51:11,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:51:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:51:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-02-15 10:51:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 10:51:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-02-15 10:51:11,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-02-15 10:51:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:11,923 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-02-15 10:51:11,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:51:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-02-15 10:51:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:51:11,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:11,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:51:11,925 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:11,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:11,925 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-15 10:51:11,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:11,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:11,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:11,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:11,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:11,981 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:51:11,982 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-15 10:51:11,983 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:11,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:11,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:11,987 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. [2019-02-15 10:51:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:11,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:11,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:11,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:11,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:11,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:12,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:12,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:12,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:12,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:12,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:12,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:12,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:12,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:12,209 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,217 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:12,248 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:12,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:12,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:12,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:12,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:51:12,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:12,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:12,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:12,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:12,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:51:12,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:12,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:12,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:12,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:12,474 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-02-15 10:51:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:12,833 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-02-15 10:51:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:51:12,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:51:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:12,835 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:51:12,835 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 10:51:12,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 10:51:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-02-15 10:51:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:51:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-02-15 10:51:12,846 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-02-15 10:51:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:12,847 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-02-15 10:51:12,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-02-15 10:51:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:51:12,847 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:12,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:51:12,848 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-15 10:51:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:12,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:12,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:12,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:12,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:12,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:51:12,919 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-15 10:51:12,921 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:12,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:12,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:12,925 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. [2019-02-15 10:51:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:12,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:12,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:12,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:12,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:12,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:12,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:12,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:51:12,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 10:51:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,984 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 [2019-02-15 10:51:12,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:12,997 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 [2019-02-15 10:51:12,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:51:13,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 10:51:13,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:51:13,124 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,134 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:13,164 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-02-15 10:51:13,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,185 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 [2019-02-15 10:51:13,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:13,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-15 10:51:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:13,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:13,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:13,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:51:13,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:13,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:51:13,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:51:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:51:13,307 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-02-15 10:51:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:13,444 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-02-15 10:51:13,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:51:13,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:51:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:13,445 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:51:13,446 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 10:51:13,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:51:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 10:51:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-02-15 10:51:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:51:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-15 10:51:13,456 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-02-15 10:51:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:13,456 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-15 10:51:13,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:51:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-15 10:51:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:13,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:13,457 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 10:51:13,457 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-02-15 10:51:13,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:13,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:13,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:13,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:13,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:13,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:13,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:13,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:13,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:13,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:13,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:13,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:13,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:13,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:13,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:13,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:13,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:13,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:13,730 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 [2019-02-15 10:51:13,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-02-15 10:51:13,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:13,742 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,756 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,764 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,772 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:13,791 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:13,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:13,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:13,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:13,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 10:51:13,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:13,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-02-15 10:51:13,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:13,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:13,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:13,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:13,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:13,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:13,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:13,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:51:13,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:13,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:51:13,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:51:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:13,980 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-02-15 10:51:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:14,325 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-02-15 10:51:14,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:14,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 10:51:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:14,327 INFO L225 Difference]: With dead ends: 65 [2019-02-15 10:51:14,327 INFO L226 Difference]: Without dead ends: 60 [2019-02-15 10:51:14,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:51:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-15 10:51:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-02-15 10:51:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:51:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-15 10:51:14,337 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-15 10:51:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:14,338 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-15 10:51:14,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:51:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-15 10:51:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:14,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:14,339 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 10:51:14,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-02-15 10:51:14,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:14,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:14,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:14,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:14,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:14,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:14,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:14,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:14,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:14,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:14,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:14,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:14,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:14,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:14,454 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 [2019-02-15 10:51:14,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:14,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:14,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:14,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:14,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:14,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:14,615 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:14,653 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:14,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:14,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:14,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:14,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 10:51:14,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:14,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-15 10:51:14,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:14,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:51:14,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:14,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:14,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:14,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:14,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:14,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-15 10:51:14,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:14,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:51:14,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:51:14,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:51:14,899 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-02-15 10:51:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:15,388 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-02-15 10:51:15,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:15,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 10:51:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:15,389 INFO L225 Difference]: With dead ends: 53 [2019-02-15 10:51:15,390 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 10:51:15,390 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 [2019-02-15 10:51:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 10:51:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-02-15 10:51:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:51:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-15 10:51:15,400 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-15 10:51:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:15,400 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-15 10:51:15,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:51:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-15 10:51:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:15,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:15,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:15,401 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:15,401 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-15 10:51:15,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:15,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:15,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:15,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:15,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:15,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:51:15,482 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-15 10:51:15,482 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:15,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:15,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:15,487 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. [2019-02-15 10:51:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:15,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:15,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:15,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:15,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:15,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:15,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:15,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:15,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:15,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:15,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,714 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 [2019-02-15 10:51:15,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:15,721 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 [2019-02-15 10:51:15,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:15,723 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,736 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,746 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:15,771 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:15,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:15,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:15,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:15,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:15,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:15,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:15,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:15,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:15,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:15,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:15,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:51:15,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:15,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:15,918 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-02-15 10:51:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:16,154 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-02-15 10:51:16,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:51:16,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:51:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:16,156 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:51:16,156 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:51:16,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:51:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-02-15 10:51:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 10:51:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-02-15 10:51:16,168 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-02-15 10:51:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:16,168 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-02-15 10:51:16,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-02-15 10:51:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:16,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:16,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:16,170 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:16,170 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-02-15 10:51:16,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:16,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:16,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:16,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:16,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:16,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:16,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:16,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:51:16,292 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-15 10:51:16,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:16,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:16,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:16,301 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. [2019-02-15 10:51:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:16,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:16,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:16,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:16,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:16,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:16,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:16,334 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 [2019-02-15 10:51:16,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:16,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,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 [2019-02-15 10:51:16,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:51:16,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,390 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,417 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 [2019-02-15 10:51:16,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,438 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 [2019-02-15 10:51:16,438 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:16,476 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-15 10:51:16,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2019-02-15 10:51:16,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 10:51:16,603 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. [2019-02-15 10:51:16,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:100 [2019-02-15 10:51:16,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,720 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:16,721 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 45 [2019-02-15 10:51:16,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,772 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:16,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 45 [2019-02-15 10:51:16,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,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, 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 [2019-02-15 10:51:16,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,870 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. [2019-02-15 10:51:16,871 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:97, output treesize:63 [2019-02-15 10:51:16,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-02-15 10:51:16,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:16,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:16,992 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:16,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 44 [2019-02-15 10:51:16,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:17,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:17,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:17,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:17,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:17,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:17,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 50 [2019-02-15 10:51:17,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:17,085 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. [2019-02-15 10:51:17,086 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-02-15 10:51:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:17,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:17,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:17,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-02-15 10:51:17,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:17,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:17,163 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-02-15 10:51:17,853 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-02-15 10:51:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:18,496 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-02-15 10:51:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 10:51:18,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:51:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:18,498 INFO L225 Difference]: With dead ends: 81 [2019-02-15 10:51:18,498 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 10:51:18,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:51:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 10:51:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-02-15 10:51:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:51:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-02-15 10:51:18,513 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-02-15 10:51:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:18,513 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-02-15 10:51:18,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-02-15 10:51:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:18,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:18,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:18,514 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-15 10:51:18,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:18,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:18,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:18,671 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:51:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:18,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:18,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:18,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:51:18,881 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-15 10:51:18,882 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:18,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:18,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:18,887 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. [2019-02-15 10:51:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:18,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:18,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:18,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:18,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:18,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:18,918 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 [2019-02-15 10:51:18,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:18,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:18,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:18,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:18,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:18,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:18,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:18,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:18,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:18,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:18,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:18,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:18,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:18,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:19,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:19,045 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,054 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,081 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:19,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:19,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:19,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:19,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,220 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:19,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:51:19,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:19,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-02-15 10:51:19,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-02-15 10:51:19,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:19,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 10:51:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:19,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:19,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:19,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:51:19,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:19,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:51:19,365 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-02-15 10:51:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:19,792 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-15 10:51:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:51:19,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:51:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:19,794 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:51:19,794 INFO L226 Difference]: Without dead ends: 64 [2019-02-15 10:51:19,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:51:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-15 10:51:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-02-15 10:51:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:51:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-15 10:51:19,811 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-15 10:51:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:19,811 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-15 10:51:19,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-15 10:51:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:19,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:19,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:19,812 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-15 10:51:19,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:19,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:19,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:19,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:19,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:19,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:19,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:19,902 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:51:19,902 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-15 10:51:19,904 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:19,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:19,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:19,907 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. [2019-02-15 10:51:19,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:19,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:19,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:19,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:19,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:19,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:19,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:19,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:51:19,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 10:51:19,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:19,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:51:19,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:19,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:20,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:20,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:20,034 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 [2019-02-15 10:51:20,074 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 [2019-02-15 10:51:20,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2019-02-15 10:51:20,114 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:20,360 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:20,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:20,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:20,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:20,524 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 10:51:20,899 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-02-15 10:51:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:20,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:51:20,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:21,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:21,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:21,310 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:51:21,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:21,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:21,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:21,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:21,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:21,437 INFO L303 Elim1Store]: Index analysis took 124 ms [2019-02-15 10:51:21,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 10:51:21,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:21,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:21,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-15 10:51:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:21,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:21,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:21,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:51:21,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:21,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:21,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:21,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:51:21,722 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-02-15 10:51:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:22,044 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-02-15 10:51:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:22,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:51:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:22,049 INFO L225 Difference]: With dead ends: 62 [2019-02-15 10:51:22,049 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 10:51:22,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 10:51:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-02-15 10:51:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:51:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-02-15 10:51:22,063 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-02-15 10:51:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:22,063 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-02-15 10:51:22,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-02-15 10:51:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:22,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:22,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:22,064 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-15 10:51:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:22,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:22,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:51:22,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:51:22,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:51:22,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:51:22,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:51:22,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:51:22,137 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-02-15 10:51:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:22,191 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-02-15 10:51:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:51:22,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:51:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:22,192 INFO L225 Difference]: With dead ends: 51 [2019-02-15 10:51:22,192 INFO L226 Difference]: Without dead ends: 46 [2019-02-15 10:51:22,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 10:51:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-15 10:51:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-02-15 10:51:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 10:51:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-02-15 10:51:22,206 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-02-15 10:51:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:22,206 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-02-15 10:51:22,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:51:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-02-15 10:51:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:22,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:22,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:22,208 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-02-15 10:51:22,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:22,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:22,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:22,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:22,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:22,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:22,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:22,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:22,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:22,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:22,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:22,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:22,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:22,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:22,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:22,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:22,353 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 [2019-02-15 10:51:22,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:22,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:22,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:22,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:22,766 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 10:51:22,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:22,901 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,909 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:22,961 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:22,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:22,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:22,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:23,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:23,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:23,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:51:23,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:23,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:23,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 10:51:23,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:23,113 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:23,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:51:23,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:23,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:23,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:51:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:23,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:23,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:51:23,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:23,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:23,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:23,242 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-02-15 10:51:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:23,966 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-02-15 10:51:23,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:23,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:51:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:23,968 INFO L225 Difference]: With dead ends: 90 [2019-02-15 10:51:23,968 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 10:51:23,969 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 [2019-02-15 10:51:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 10:51:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-02-15 10:51:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:51:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-02-15 10:51:23,987 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-02-15 10:51:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:23,987 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-02-15 10:51:23,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-02-15 10:51:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:23,988 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:23,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:23,988 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:23,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-15 10:51:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:23,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:23,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:24,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:24,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:24,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:51:24,043 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-15 10:51:24,044 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:24,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:24,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:24,048 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. [2019-02-15 10:51:24,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:24,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:24,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:24,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:24,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:24,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:24,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:24,209 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 10:51:24,225 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 [2019-02-15 10:51:24,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:24,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:24,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:24,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:24,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:24,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:24,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:24,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:24,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:24,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:24,762 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:24,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:25,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:25,284 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 10:51:25,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:25,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:25,346 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:25,357 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:25,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:25,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:25,387 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:25,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:25,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:25,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:25,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:25,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:25,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:51:25,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:25,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:25,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 10:51:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:25,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:25,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:25,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:51:25,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:25,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:25,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:51:25,999 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-02-15 10:51:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:26,157 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-02-15 10:51:26,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:51:26,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:51:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:26,158 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:51:26,159 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:51:26,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:51:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-02-15 10:51:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 10:51:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-02-15 10:51:26,181 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-02-15 10:51:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:26,182 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-02-15 10:51:26,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-02-15 10:51:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:26,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:26,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:26,182 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-15 10:51:26,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:26,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:26,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:26,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:26,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:51:26,268 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-15 10:51:26,269 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:26,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:26,272 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:26,272 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. [2019-02-15 10:51:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:26,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:26,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:26,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:26,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:26,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:26,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:26,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:26,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:26,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,407 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 [2019-02-15 10:51:26,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:26,411 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 [2019-02-15 10:51:26,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:26,414 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,439 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:26,618 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:26,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:26,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:26,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:26,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:26,686 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:26,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-02-15 10:51:26,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:26,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:26,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 10:51:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:26,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:51:26,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:26,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:51:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:51:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:51:26,764 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-02-15 10:51:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:26,989 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-02-15 10:51:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:51:26,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-15 10:51:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:26,991 INFO L225 Difference]: With dead ends: 63 [2019-02-15 10:51:26,991 INFO L226 Difference]: Without dead ends: 62 [2019-02-15 10:51:26,991 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 [2019-02-15 10:51:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-15 10:51:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-02-15 10:51:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 10:51:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-02-15 10:51:27,012 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-02-15 10:51:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:27,012 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-02-15 10:51:27,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:51:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-02-15 10:51:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:51:27,013 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:27,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:51:27,013 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-15 10:51:27,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:27,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:27,224 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-15 10:51:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:27,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:27,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:27,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:27,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:27,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:27,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:27,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:27,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:27,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:51:27,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:27,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:27,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:51:27,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:27,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:27,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:27,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:27,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:27,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:27,413 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,421 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:27,450 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:27,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:27,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:27,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:27,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:27,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:27,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:27,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:27,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:27,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:27,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:51:27,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:27,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:27,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:27,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:27,582 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-02-15 10:51:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:27,780 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-02-15 10:51:27,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:51:27,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:51:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:27,782 INFO L225 Difference]: With dead ends: 86 [2019-02-15 10:51:27,782 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:51:27,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:51:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:51:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-02-15 10:51:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:51:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-02-15 10:51:27,808 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-02-15 10:51:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:27,808 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-02-15 10:51:27,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-02-15 10:51:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:27,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:27,809 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-15 10:51:27,810 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-02-15 10:51:27,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:27,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:27,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:27,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:27,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:51:27,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:27,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:27,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:27,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:27,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:27,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:27,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:27,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:27,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:27,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:27,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:27,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:27,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:28,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:28,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:28,055 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 [2019-02-15 10:51:28,058 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 [2019-02-15 10:51:28,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:28,061 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,075 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:28,110 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:28,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:28,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:28,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:28,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 10:51:28,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:28,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-15 10:51:28,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:28,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:28,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:51:28,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:28,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:28,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:51:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:28,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:28,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:28,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-15 10:51:28,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:28,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:51:28,375 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-02-15 10:51:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:28,826 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-02-15 10:51:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:28,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:51:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:28,828 INFO L225 Difference]: With dead ends: 96 [2019-02-15 10:51:28,828 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 10:51:28,829 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 [2019-02-15 10:51:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 10:51:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-02-15 10:51:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 10:51:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-02-15 10:51:28,854 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-02-15 10:51:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:28,854 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-02-15 10:51:28,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-02-15 10:51:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:28,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:28,855 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:51:28,855 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-02-15 10:51:28,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:28,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:28,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:28,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:28,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:28,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:28,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:28,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:28,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:28,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:28,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:28,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:28,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:28,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:28,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:28,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:28,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:28,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:29,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:29,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:29,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:29,121 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 [2019-02-15 10:51:29,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-02-15 10:51:29,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:29,124 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,139 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,147 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:29,173 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:29,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:29,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:29,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 10:51:29,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:29,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-15 10:51:29,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:29,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,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. [2019-02-15 10:51:29,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:29,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:29,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 10:51:29,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:29,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:29,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 10:51:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:29,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:29,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:29,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:51:29,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:29,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:51:29,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:51:29,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:29,588 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-02-15 10:51:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:30,038 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-02-15 10:51:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:30,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:51:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:30,040 INFO L225 Difference]: With dead ends: 107 [2019-02-15 10:51:30,040 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 10:51:30,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:51:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 10:51:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-02-15 10:51:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 10:51:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-02-15 10:51:30,077 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-02-15 10:51:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:30,077 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-02-15 10:51:30,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:51:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-02-15 10:51:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:30,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:30,078 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:51:30,078 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-02-15 10:51:30,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:30,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:30,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:30,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:30,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:30,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:30,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:30,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:30,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:30,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:30,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:30,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:30,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:30,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:30,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:30,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:30,502 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:30,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:30,641 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,658 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:30,695 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:30,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:30,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:30,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:30,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:30,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:30,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:30,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:51:30,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:30,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-02-15 10:51:30,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:30,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 10:51:30,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:30,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:30,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 10:51:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:30,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:31,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:31,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:51:31,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:31,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:51:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:51:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:31,072 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-02-15 10:51:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:31,471 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-02-15 10:51:31,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:31,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:51:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:31,473 INFO L225 Difference]: With dead ends: 116 [2019-02-15 10:51:31,474 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 10:51:31,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:51:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 10:51:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-02-15 10:51:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 10:51:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-02-15 10:51:31,501 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-02-15 10:51:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:31,501 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-02-15 10:51:31,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:51:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-02-15 10:51:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:31,502 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:31,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:31,502 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-15 10:51:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:31,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:31,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:31,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:31,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:31,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:31,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:31,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:31,567 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-15 10:51:31,569 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:31,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:31,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:31,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. [2019-02-15 10:51:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:31,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:31,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:31,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:31,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:31,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:31,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:31,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:31,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:31,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:31,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:31,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:31,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:31,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:31,756 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,764 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,773 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:31,792 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:31,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:31,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:31,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:31,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:31,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:31,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:31,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:31,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:31,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:31,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:31,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:51:31,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:31,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:51:31,939 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-02-15 10:51:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:32,204 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-02-15 10:51:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:51:32,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:51:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:32,205 INFO L225 Difference]: With dead ends: 72 [2019-02-15 10:51:32,205 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 10:51:32,206 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 [2019-02-15 10:51:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 10:51:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-02-15 10:51:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 10:51:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-02-15 10:51:32,234 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-02-15 10:51:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-02-15 10:51:32,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-02-15 10:51:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:32,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:32,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:32,236 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-15 10:51:32,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:32,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:32,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:32,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:32,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:32,322 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:32,323 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-15 10:51:32,324 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:32,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:32,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:32,327 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. [2019-02-15 10:51:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:32,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:32,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:32,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:32,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:32,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:32,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:32,376 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 [2019-02-15 10:51:32,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:32,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,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 [2019-02-15 10:51:32,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:32,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:32,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:32,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:32,512 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,529 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,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. [2019-02-15 10:51:32,547 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:32,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:32,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:32,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:32,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:32,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:32,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:32,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,666 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:32,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:32,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:51:32,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:32,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:32,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:51:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:32,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:32,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:32,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:51:32,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:32,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:32,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:32,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:32,757 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-02-15 10:51:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:33,109 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-02-15 10:51:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:33,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:51:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:33,110 INFO L225 Difference]: With dead ends: 77 [2019-02-15 10:51:33,110 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 10:51:33,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 10:51:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-15 10:51:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 10:51:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-02-15 10:51:33,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-02-15 10:51:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:33,141 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-02-15 10:51:33,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-02-15 10:51:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:33,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:33,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:33,142 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-15 10:51:33,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:33,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:33,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:33,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:33,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:33,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:33,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:33,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:33,252 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-15 10:51:33,254 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:33,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:33,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:33,258 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. [2019-02-15 10:51:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:33,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:33,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:33,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:33,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:33,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:33,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:33,295 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 [2019-02-15 10:51:33,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:33,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:33,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:33,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:33,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:33,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,433 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,458 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:33,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:33,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,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. [2019-02-15 10:51:33,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:33,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:33,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:33,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:33,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:33,712 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:33,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:51:33,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:33,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:51:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:33,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:33,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:51:33,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:33,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:51:33,821 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-02-15 10:51:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:34,152 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-02-15 10:51:34,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:51:34,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:51:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:34,154 INFO L225 Difference]: With dead ends: 78 [2019-02-15 10:51:34,154 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 10:51:34,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:51:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 10:51:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-02-15 10:51:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 10:51:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-02-15 10:51:34,187 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-02-15 10:51:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:34,187 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-02-15 10:51:34,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-02-15 10:51:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:34,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:34,188 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:51:34,188 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-02-15 10:51:34,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:34,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:34,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:34,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:34,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:34,270 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:34,270 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-15 10:51:34,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:34,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:34,277 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:34,277 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. [2019-02-15 10:51:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:34,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:34,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:34,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:34,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:34,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:34,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:34,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:34,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:34,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:34,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,404 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 [2019-02-15 10:51:34,407 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 [2019-02-15 10:51:34,410 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 [2019-02-15 10:51:34,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:34,412 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,426 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,436 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:34,466 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:34,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:34,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:34,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:34,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:51:34,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:34,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:34,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:51:34,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:34,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:51:34,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:34,654 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:34,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 10:51:34,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:34,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:34,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:51:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:34,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:34,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:34,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:51:34,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:34,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:51:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:51:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:34,765 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-02-15 10:51:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:35,231 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-02-15 10:51:35,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:35,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:51:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:35,233 INFO L225 Difference]: With dead ends: 95 [2019-02-15 10:51:35,233 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 10:51:35,234 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 [2019-02-15 10:51:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 10:51:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-02-15 10:51:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:51:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-02-15 10:51:35,264 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-02-15 10:51:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:35,264 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-02-15 10:51:35,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:51:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-02-15 10:51:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:35,265 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:35,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:35,265 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:35,265 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-15 10:51:35,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:35,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:35,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:35,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:35,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:35,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:35,380 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-15 10:51:35,381 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:35,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:35,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:35,385 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. [2019-02-15 10:51:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:35,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:35,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:35,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:35,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:35,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:35,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:35,418 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 [2019-02-15 10:51:35,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:35,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:35,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:35,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:35,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:35,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:35,689 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,698 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:35,737 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:35,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:35,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:35,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:35,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:35,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:51:35,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,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. [2019-02-15 10:51:35,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 10:51:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:35,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:35,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:35,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 10:51:35,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:35,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:51:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:51:35,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:35,993 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-02-15 10:51:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:36,644 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-02-15 10:51:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:36,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:51:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:36,647 INFO L225 Difference]: With dead ends: 90 [2019-02-15 10:51:36,647 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 10:51:36,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:51:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 10:51:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-02-15 10:51:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-15 10:51:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-02-15 10:51:36,732 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-02-15 10:51:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:36,733 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-02-15 10:51:36,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:51:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-02-15 10:51:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:36,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:36,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:36,734 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-15 10:51:36,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:36,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:37,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:37,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:37,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:37,094 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-15 10:51:37,095 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:37,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:37,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:37,099 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. [2019-02-15 10:51:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:37,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:37,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:37,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:37,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:37,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:37,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:37,128 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 [2019-02-15 10:51:37,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:37,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:37,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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:51:37,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:51:37,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,209 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 [2019-02-15 10:51:37,210 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:37,226 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-15 10:51:37,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:51:37,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:37,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:37,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,282 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:37,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, 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 [2019-02-15 10:51:37,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:37,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-15 10:51:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:37,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:51:37,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:37,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:37,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-15 10:51:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:37,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:37,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:37,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:51:37,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:37,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:37,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:37,402 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-02-15 10:51:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:37,726 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-02-15 10:51:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:37,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:51:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:37,728 INFO L225 Difference]: With dead ends: 122 [2019-02-15 10:51:37,729 INFO L226 Difference]: Without dead ends: 121 [2019-02-15 10:51:37,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-15 10:51:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-02-15 10:51:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 10:51:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-02-15 10:51:37,776 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-02-15 10:51:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:37,776 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-02-15 10:51:37,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-02-15 10:51:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:37,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:37,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:37,777 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-15 10:51:37,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:37,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:37,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:37,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:37,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:37,948 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-15 10:51:37,949 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:37,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:37,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:37,952 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. [2019-02-15 10:51:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:37,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:37,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:37,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:37,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:37,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:37,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:37,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:51:37,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,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 22 treesize of output 38 [2019-02-15 10:51:38,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:51:38,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,059 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 [2019-02-15 10:51:38,063 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 [2019-02-15 10:51:38,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-02-15 10:51:38,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2019-02-15 10:51:38,069 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,081 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:38,112 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 10:51:38,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:51:38,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:38,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:38,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:38,173 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:38,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 28 treesize of output 41 [2019-02-15 10:51:38,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:38,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 10:51:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:38,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:38,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:38,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:51:38,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:38,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:38,276 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-02-15 10:51:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:38,489 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-02-15 10:51:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:51:38,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:51:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:38,491 INFO L225 Difference]: With dead ends: 113 [2019-02-15 10:51:38,491 INFO L226 Difference]: Without dead ends: 108 [2019-02-15 10:51:38,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-15 10:51:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-02-15 10:51:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 10:51:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-02-15 10:51:38,551 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-02-15 10:51:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:38,551 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-02-15 10:51:38,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-02-15 10:51:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:38,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:38,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:38,552 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-15 10:51:38,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:38,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:38,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:38,888 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-15 10:51:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:39,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:39,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:39,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:39,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:39,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:39,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:39,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:39,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:39,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:39,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:39,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:39,397 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 10:51:39,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:39,547 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 10:51:39,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:39,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:39,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,707 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 [2019-02-15 10:51:39,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:39,712 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 [2019-02-15 10:51:39,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:39,716 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,823 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:39,849 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:39,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:39,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:39,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:39,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:39,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:39,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,964 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:39,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:39,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 [2019-02-15 10:51:39,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:39,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:39,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:51:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:40,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:40,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:40,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:51:40,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:40,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:51:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:51:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:40,063 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-02-15 10:51:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:40,409 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-02-15 10:51:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:40,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:51:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:40,411 INFO L225 Difference]: With dead ends: 137 [2019-02-15 10:51:40,412 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 10:51:40,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:51:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 10:51:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-15 10:51:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 10:51:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-02-15 10:51:40,466 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-02-15 10:51:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:40,466 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-02-15 10:51:40,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:51:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-02-15 10:51:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:40,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:40,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:40,468 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-15 10:51:40,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:40,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:40,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:40,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:40,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:40,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:40,524 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-15 10:51:40,524 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:40,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:40,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:40,527 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. [2019-02-15 10:51:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:40,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:40,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:40,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:40,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:40,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:40,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:40,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-02-15 10:51:40,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-15 10:51:40,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,670 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 [2019-02-15 10:51:40,670 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,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 [2019-02-15 10:51:40,696 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 [2019-02-15 10:51:40,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-02-15 10:51:40,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:51:40,708 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,718 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,726 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:40,747 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-02-15 10:51:40,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:51:40,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-15 10:51:40,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:40,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:51:40,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:40,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:40,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-15 10:51:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:40,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:41,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:41,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:51:41,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:41,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:41,033 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-02-15 10:51:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:41,289 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-02-15 10:51:41,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:51:41,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:51:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:41,294 INFO L225 Difference]: With dead ends: 110 [2019-02-15 10:51:41,294 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 10:51:41,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:51:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 10:51:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-02-15 10:51:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-15 10:51:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-02-15 10:51:41,339 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-02-15 10:51:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:41,340 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-02-15 10:51:41,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-02-15 10:51:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:41,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:41,340 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:51:41,340 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-02-15 10:51:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:41,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:41,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:41,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:41,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:41,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:41,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:41,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:41,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:41,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:41,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:41,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:41,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:41,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:41,973 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 [2019-02-15 10:51:41,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:41,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:41,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:41,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:41,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:41,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:41,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:41,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:41,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:42,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:42,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:42,100 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,108 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:42,136 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:42,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:42,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:42,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:51:42,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:42,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 10:51:42,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,247 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:42,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 10:51:42,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:42,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 10:51:42,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:42,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:51:42,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:42,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:51:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:42,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:42,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:42,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 10:51:42,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:42,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:51:42,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:51:42,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:51:42,401 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-02-15 10:51:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:42,821 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-02-15 10:51:42,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:42,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:51:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:42,823 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:51:42,823 INFO L226 Difference]: Without dead ends: 116 [2019-02-15 10:51:42,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:51:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-15 10:51:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-02-15 10:51:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 10:51:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-02-15 10:51:42,867 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-02-15 10:51:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:42,868 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-02-15 10:51:42,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:51:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-02-15 10:51:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:42,868 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:42,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:42,869 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-02-15 10:51:42,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:42,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:42,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:42,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:42,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:42,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:42,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:42,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:51:42,933 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-15 10:51:42,934 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:42,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:42,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:42,936 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. [2019-02-15 10:51:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:42,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:42,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:42,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:42,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:42,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:42,974 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 [2019-02-15 10:51:42,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:43,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:43,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:43,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:43,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:43,169 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,177 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,209 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:43,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:43,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:43,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:43,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:51:43,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:43,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 10:51:43,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,326 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:43,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 10:51:43,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:43,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:51:43,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:43,381 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:43,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:51:43,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:43,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:43,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 10:51:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:43,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:43,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:43,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:51:43,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:43,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:51:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:51:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:43,504 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-02-15 10:51:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:44,006 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-02-15 10:51:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:44,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:51:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:44,008 INFO L225 Difference]: With dead ends: 137 [2019-02-15 10:51:44,008 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 10:51:44,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:51:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 10:51:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-02-15 10:51:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 10:51:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-02-15 10:51:44,069 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-02-15 10:51:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:44,069 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-02-15 10:51:44,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:51:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-02-15 10:51:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:44,070 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:44,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:44,070 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:44,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:44,071 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-02-15 10:51:44,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:44,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:44,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:44,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:44,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:44,312 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-15 10:51:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:44,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:44,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:44,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:44,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:44,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:44,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:44,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:44,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:44,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:44,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:44,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:44,445 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 [2019-02-15 10:51:44,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:44,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:44,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:44,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:44,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:44,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:44,599 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,609 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,617 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,636 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:44,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:44,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:44,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:44,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,734 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:44,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:51:44,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:44,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-15 10:51:44,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:51:44,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:44,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-15 10:51:44,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,833 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:44,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:44,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:51:44,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:44,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:44,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-15 10:51:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:44,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:44,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:44,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:51:44,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:44,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:51:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:51:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:44,949 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-02-15 10:51:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:45,571 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-02-15 10:51:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:45,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:51:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:45,574 INFO L225 Difference]: With dead ends: 172 [2019-02-15 10:51:45,574 INFO L226 Difference]: Without dead ends: 167 [2019-02-15 10:51:45,575 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 [2019-02-15 10:51:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-15 10:51:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-02-15 10:51:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-15 10:51:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-02-15 10:51:45,642 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-02-15 10:51:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:45,642 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-02-15 10:51:45,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:51:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-02-15 10:51:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:51:45,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:45,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:51:45,643 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:45,643 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-02-15 10:51:45,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:45,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:45,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:45,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:45,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:45,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:45,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:45,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:45,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:45,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:45,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:45,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:45,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:45,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:45,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:45,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:45,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:45,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:45,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:45,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:45,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:45,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:45,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:45,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:45,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:45,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:45,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:45,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:45,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:45,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:45,947 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 [2019-02-15 10:51:45,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:45,949 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:45,978 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:45,993 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:46,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:46,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:46,030 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:46,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:46,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:46,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:46,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:46,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,197 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:46,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:51:46,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:46,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:46,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-15 10:51:46,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 10:51:46,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:46,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:46,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-15 10:51:46,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:46,362 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:46,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 10:51:46,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:46,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:46,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-15 10:51:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:46,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:46,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:46,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:51:46,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:46,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:51:46,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:51:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:51:46,477 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-02-15 10:51:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:46,916 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-02-15 10:51:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:46,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:51:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:46,918 INFO L225 Difference]: With dead ends: 140 [2019-02-15 10:51:46,918 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 10:51:46,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:51:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 10:51:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-02-15 10:51:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 10:51:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-02-15 10:51:46,967 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-02-15 10:51:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:46,967 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-02-15 10:51:46,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:51:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-02-15 10:51:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:46,968 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:46,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:46,968 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:46,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-15 10:51:46,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:46,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:46,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:46,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:46,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:47,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:47,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:47,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:51:47,095 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-15 10:51:47,096 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:47,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:47,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:47,099 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. [2019-02-15 10:51:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:47,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:47,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:47,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:47,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:47,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:47,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:47,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:51:47,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:47,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:47,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:47,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:47,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:47,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:47,278 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,288 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,315 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:47,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:47,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:47,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:47,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:47,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:47,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:47,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,437 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:47,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:47,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:51:47,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:47,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 10:51:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:47,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:47,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:47,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:51:47,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:47,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:47,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:47,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:47,535 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-02-15 10:51:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:47,988 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-02-15 10:51:47,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:47,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:51:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:47,989 INFO L225 Difference]: With dead ends: 77 [2019-02-15 10:51:47,989 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 10:51:47,990 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 [2019-02-15 10:51:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 10:51:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-02-15 10:51:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-15 10:51:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-02-15 10:51:48,045 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-02-15 10:51:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:48,045 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-02-15 10:51:48,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-02-15 10:51:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:48,046 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:48,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:48,046 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:48,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-15 10:51:48,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:48,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:48,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:48,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:48,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:48,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:48,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:48,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:51:48,149 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-15 10:51:48,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:48,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:48,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:48,158 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. [2019-02-15 10:51:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:48,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:48,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:48,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:48,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:48,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:48,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:48,208 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 [2019-02-15 10:51:48,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:48,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:48,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,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 22 treesize of output 45 [2019-02-15 10:51:48,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:48,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:48,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:48,338 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,348 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,357 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,375 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:48,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51: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 [2019-02-15 10:51:48,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:48,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:48,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:48,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:48,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:48,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,491 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:48,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 77 [2019-02-15 10:51:48,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:48,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:51:48,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,579 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:48,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:48,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:51:48,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:48,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:48,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-15 10:51:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:48,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:48,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:48,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:51:48,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:48,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:51:48,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:51:48,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:48,688 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-02-15 10:51:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:49,217 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-02-15 10:51:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:49,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 10:51:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:49,219 INFO L225 Difference]: With dead ends: 86 [2019-02-15 10:51:49,219 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:51:49,219 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 [2019-02-15 10:51:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:51:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-02-15 10:51:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 10:51:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-02-15 10:51:49,303 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-02-15 10:51:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:49,303 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-02-15 10:51:49,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:51:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-02-15 10:51:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:49,304 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:49,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:49,304 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:49,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-02-15 10:51:49,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:49,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:49,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:49,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:49,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:49,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:49,518 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:51:49,518 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-02-15 10:51:49,519 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:49,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:49,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:49,522 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. [2019-02-15 10:51:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:49,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:49,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:49,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:49,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:49,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:49,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:49,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:51:49,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 10:51:49,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 10:51:49,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-15 10:51:49,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:49,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:49,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:49,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:49,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:49,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-02-15 10:51:49,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:49,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, 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 [2019-02-15 10:51:49,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:51:49,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 10:51:49,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-02-15 10:51:49,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:49,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-15 10:51:49,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:49,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:49,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:49,664 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:49,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-02-15 10:51:49,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:49,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 10:51:49,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-02-15 10:51:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:49,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:49,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:51:49,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-02-15 10:51:49,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:51:49,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 10:51:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 10:51:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:49,727 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-02-15 10:51:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:49,943 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-02-15 10:51:49,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:51:49,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-15 10:51:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:49,945 INFO L225 Difference]: With dead ends: 115 [2019-02-15 10:51:49,946 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 10:51:49,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:51:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 10:51:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-02-15 10:51:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 10:51:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-02-15 10:51:50,053 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-02-15 10:51:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:50,053 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-02-15 10:51:50,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 10:51:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-02-15 10:51:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:50,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:50,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:50,054 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:50,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-15 10:51:50,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:50,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:50,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:50,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:50,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:50,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:50,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:50,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:50,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:50,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:50,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:50,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:50,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:50,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:50,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:50,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:50,184 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 [2019-02-15 10:51:50,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:50,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:50,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:50,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:50,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:50,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:50,324 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,339 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,357 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:50,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:50,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:50,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:50,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,430 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:50,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 10:51:50,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:50,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-15 10:51:50,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 10:51:50,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:50,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 10:51:50,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:50,528 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:50,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 10:51:50,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:50,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:50,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 10:51:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:50,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:50,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:50,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:51:50,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:50,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:51:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:51:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:50,644 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-02-15 10:51:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:51,276 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-02-15 10:51:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:51,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:51:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:51,277 INFO L225 Difference]: With dead ends: 104 [2019-02-15 10:51:51,277 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 10:51:51,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:51:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 10:51:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-02-15 10:51:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:51:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-02-15 10:51:51,351 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-02-15 10:51:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:51,351 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-02-15 10:51:51,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:51:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-02-15 10:51:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:51,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:51,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:51,352 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:51,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-02-15 10:51:51,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:51,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:51,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:51,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:51,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:51,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:51,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:51,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:51:51,402 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-15 10:51:51,403 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:51,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:51,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:51,406 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. [2019-02-15 10:51:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:51,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:51,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:51,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:51,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:51,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:51,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:51:51,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 10:51:51,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,441 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 [2019-02-15 10:51:51,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,450 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 [2019-02-15 10:51:51,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:51:51,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 10:51:51,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:51:51,577 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:51,611 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 10:51:51,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:51:51,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:51,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:51,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 10:51:51,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:51,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-15 10:51:51,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,707 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:51,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:51,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-02-15 10:51:51,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:51,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:51,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-02-15 10:51:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:51,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:51,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:51,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:51:51,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:51,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:51:51,796 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-02-15 10:51:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:52,204 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-02-15 10:51:52,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:52,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:51:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:52,205 INFO L225 Difference]: With dead ends: 68 [2019-02-15 10:51:52,205 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 10:51:52,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:51:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 10:51:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-02-15 10:51:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 10:51:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-02-15 10:51:52,366 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-02-15 10:51:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:52,366 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-02-15 10:51:52,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-02-15 10:51:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:52,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:52,367 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 10:51:52,367 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-02-15 10:51:52,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:52,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:52,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:52,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:52,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:51:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:51:52,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:51:52,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:51:52,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:51:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:51:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:51:52,556 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-02-15 10:51:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:52,730 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-02-15 10:51:52,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:51:52,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-15 10:51:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:52,731 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:51:52,732 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 10:51:52,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:51:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 10:51:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-15 10:51:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 10:51:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-02-15 10:51:52,823 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-02-15 10:51:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:52,824 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-02-15 10:51:52,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:51:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-02-15 10:51:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:52,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:52,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:52,824 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-15 10:51:52,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:52,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:52,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:53,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:53,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:53,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:51:53,017 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-15 10:51:53,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:53,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:53,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:53,020 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. [2019-02-15 10:51:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:53,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:53,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:53,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:53,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:53,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:53,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:53,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:53,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:53,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:53,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,151 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 [2019-02-15 10:51:53,153 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 [2019-02-15 10:51:53,157 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 [2019-02-15 10:51:53,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:53,176 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,429 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:53,794 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:53,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:53,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:53,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:53,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,861 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:53,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 10:51:53,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:53,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 10:51:53,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:53,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:51:53,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:53,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:53,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-15 10:51:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:53,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:54,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:54,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:51:54,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:54,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:54,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:54,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:51:54,033 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-02-15 10:51:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:54,423 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-02-15 10:51:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:51:54,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:51:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:54,424 INFO L225 Difference]: With dead ends: 78 [2019-02-15 10:51:54,424 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:51:54,425 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 [2019-02-15 10:51:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:51:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-02-15 10:51:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 10:51:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-02-15 10:51:54,540 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-02-15 10:51:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:54,540 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-02-15 10:51:54,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-02-15 10:51:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:54,541 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:54,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:54,541 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-02-15 10:51:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:54,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:54,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:54,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:54,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:54,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:54,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:54,656 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:51:54,656 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-15 10:51:54,658 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:54,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:54,660 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:54,661 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. [2019-02-15 10:51:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:54,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:54,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:54,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:54,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:54,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:54,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:54,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:54,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:54,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,801 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 [2019-02-15 10:51:54,803 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 [2019-02-15 10:51:54,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, 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 [2019-02-15 10:51:54,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:54,807 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,832 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:54,859 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:54,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:51:54,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:54,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:54,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:54,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 10:51:54,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:54,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:54,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:54,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:55,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:55,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:51:55,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:55,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:51:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:51:55,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:51:55,004 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-02-15 10:51:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:55,466 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-02-15 10:51:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:55,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:51:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:55,467 INFO L225 Difference]: With dead ends: 64 [2019-02-15 10:51:55,467 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 10:51:55,468 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 [2019-02-15 10:51:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 10:51:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-02-15 10:51:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 10:51:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-02-15 10:51:55,572 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-02-15 10:51:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:55,572 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-02-15 10:51:55,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:51:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-02-15 10:51:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:55,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:55,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:55,573 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-15 10:51:55,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:55,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:55,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:55,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:55,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:55,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:55,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:55,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:55,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:55,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:55,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:55,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:55,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:55,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:51:55,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:55,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:55,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:51:55,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51: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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 10:51:55,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:51:55,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,743 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,785 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 [2019-02-15 10:51:55,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:55,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-02-15 10:51:55,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2019-02-15 10:51:55,795 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,809 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:55,841 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 10:51:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:51:55,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:55,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:51:55,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 10:51:55,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:55,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-15 10:51:55,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:55,942 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:55,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-02-15 10:51:55,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:55,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:55,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-15 10:51:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:56,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:56,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:56,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:51:56,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:56,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:51:56,082 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-02-15 10:51:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:56,551 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-02-15 10:51:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:51:56,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:51:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:56,552 INFO L225 Difference]: With dead ends: 76 [2019-02-15 10:51:56,552 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 10:51:56,552 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 [2019-02-15 10:51:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 10:51:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-02-15 10:51:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 10:51:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-02-15 10:51:56,669 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-02-15 10:51:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:56,669 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-02-15 10:51:56,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-02-15 10:51:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:51:56,670 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:56,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:56,670 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-02-15 10:51:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:56,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:56,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:56,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:56,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:56,797 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 10:51:56,797 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-02-15 10:51:56,798 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:56,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:56,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:56,801 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. [2019-02-15 10:51:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:56,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:56,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:56,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:56,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:56,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:56,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:56,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-15 10:51:56,825 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 [2019-02-15 10:51:56,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:56,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:56,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:56,845 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 [2019-02-15 10:51:56,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,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, 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 [2019-02-15 10:51:56,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-02-15 10:51:56,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 10:51:56,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:51:56,885 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,896 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,904 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:56,923 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-15 10:51:56,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:56,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 10:51:56,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:51:56,989 INFO 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. [2019-02-15 10:51:56,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-15 10:51:57,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:57,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:57,015 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:51:57,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:51:57,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:57,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:57,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:57,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:57,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:57,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:57,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-02-15 10:51:57,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:57,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:51:57,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-15 10:51:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:57,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:57,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:57,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-15 10:51:57,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:51:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:51:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:51:57,132 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-02-15 10:51:57,639 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-02-15 10:51:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:58,169 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-02-15 10:51:58,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:51:58,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 10:51:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:58,171 INFO L225 Difference]: With dead ends: 90 [2019-02-15 10:51:58,171 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 10:51:58,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:51:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 10:51:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-02-15 10:51:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 10:51:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-02-15 10:51:58,369 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-02-15 10:51:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:58,369 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-02-15 10:51:58,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:51:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-02-15 10:51:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:51:58,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:58,370 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:58,370 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:58,370 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-02-15 10:51:58,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:58,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:51:58,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:58,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:58,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:51:58,548 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-15 10:51:58,549 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:58,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:58,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:58,551 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. [2019-02-15 10:51:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:58,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:58,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:58,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:58,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:58,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:58,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:58,582 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 [2019-02-15 10:51:58,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:51:58,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:51:58,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:51:58,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:51:58,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:51:58,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:51:58,727 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,737 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,746 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:58,764 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 10:51:58,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:51:58,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:58,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 10:51:58,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:51:58,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:58,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:51:58,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:51:58,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 10:51:58,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:58,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:51:58,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 10:51:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:58,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:58,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:58,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 10:51:58,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:58,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:51:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:51:58,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:51:58,972 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-02-15 10:51:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:59,603 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-02-15 10:51:59,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:51:59,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 10:51:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:59,605 INFO L225 Difference]: With dead ends: 118 [2019-02-15 10:51:59,606 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 10:51:59,606 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 [2019-02-15 10:51:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 10:51:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-02-15 10:51:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-15 10:51:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-02-15 10:51:59,832 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-02-15 10:51:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:59,832 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-02-15 10:51:59,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:51:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-02-15 10:51:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:51:59,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:59,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:51:59,833 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-02-15 10:51:59,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:59,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:59,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:59,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:59,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:59,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:59,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:59,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:51:59,955 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-02-15 10:51:59,956 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:51:59,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:51:59,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:51:59,958 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. [2019-02-15 10:51:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:59,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:51:59,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:59,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:59,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:59,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:59,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:59,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-02-15 10:52:00,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 10:52:00,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 10:52:00,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:52:00,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:52:00,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:52:00,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:52:00,136 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,146 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,173 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:52:00,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:52:00,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:00,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:52:00,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:52:00,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:00,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:52:00,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,298 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:00,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:52:00,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:00,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 10:52:00,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,503 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:00,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:00,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:52:00,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:00,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:00,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-15 10:52:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:00,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:00,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:00,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 10:52:00,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:00,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:52:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:52:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:52:00,615 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-02-15 10:52:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:01,432 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-02-15 10:52:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:52:01,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-15 10:52:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:01,433 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:52:01,433 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 10:52:01,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:52:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 10:52:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-02-15 10:52:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:52:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-02-15 10:52:01,715 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-02-15 10:52:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:01,715 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-02-15 10:52:01,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:52:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-02-15 10:52:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:52:01,716 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:01,716 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 10:52:01,716 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-02-15 10:52:01,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:01,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:01,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:52:01,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:01,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:01,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:52:01,804 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-02-15 10:52:01,806 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:01,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:01,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:01,809 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. [2019-02-15 10:52:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:01,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:01,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:01,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:01,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:01,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:01,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:01,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:52:01,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 10:52:01,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 10:52:01,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:01,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:01,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:01,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 10:52:01,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:01,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:01,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:01,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:01,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-15 10:52:01,890 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 [2019-02-15 10:52:01,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:01,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:01,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:01,906 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 [2019-02-15 10:52:01,906 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:01,911 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:01,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:01,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:01,930 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-15 10:52:01,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:01,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2019-02-15 10:52:01,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:52:01,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 10:52:01,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-15 10:52:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:52:02,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:02,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-02-15 10:52:02,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:02,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 10:52:02,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-02-15 10:52:02,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 10:52:02,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:02,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:02,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-02-15 10:52:02,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:02,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:52:02,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-02-15 10:52:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:02,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:02,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:02,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:52:02,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:02,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:52:02,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:52:02,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:52:02,224 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-02-15 10:52:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:02,956 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-02-15 10:52:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:52:02,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 10:52:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:02,958 INFO L225 Difference]: With dead ends: 87 [2019-02-15 10:52:02,958 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 10:52:02,958 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 [2019-02-15 10:52:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 10:52:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-02-15 10:52:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 10:52:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-02-15 10:52:03,272 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-02-15 10:52:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:03,272 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-02-15 10:52:03,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:52:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-02-15 10:52:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:52:03,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:03,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:52:03,273 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-02-15 10:52:03,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:03,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:03,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:03,435 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:52:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:52:03,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:03,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:03,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:03,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:03,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:03,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:03,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:03,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:03,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:52:03,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:03,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:03,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 10:52:03,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 10:52:03,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,541 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 [2019-02-15 10:52:03,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,548 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 [2019-02-15 10:52:03,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 10:52:03,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 10:52:03,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 10:52:03,643 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,652 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,677 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-02-15 10:52:03,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:52:03,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:52:03,769 INFO 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. [2019-02-15 10:52:03,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-02-15 10:52:03,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 10:52:03,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,926 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:03,926 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 [2019-02-15 10:52:03,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:52:03,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-02-15 10:52:03,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:03,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,004 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:04,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 77 [2019-02-15 10:52:04,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:04,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-02-15 10:52:04,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:04,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:52:04,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-02-15 10:52:04,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,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 30 treesize of output 40 [2019-02-15 10:52:04,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:04,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:04,161 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:04,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-15 10:52:04,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:04,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 10:52:04,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-02-15 10:52:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:04,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:04,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:04,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 10:52:04,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:04,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:52:04,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:52:04,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:52:04,301 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-02-15 10:52:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:05,552 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-02-15 10:52:05,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:52:05,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-15 10:52:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:05,554 INFO L225 Difference]: With dead ends: 186 [2019-02-15 10:52:05,554 INFO L226 Difference]: Without dead ends: 177 [2019-02-15 10:52:05,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:52:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-15 10:52:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-02-15 10:52:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 10:52:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-02-15 10:52:05,953 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-02-15 10:52:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:05,953 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-02-15 10:52:05,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:52:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-02-15 10:52:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:52:05,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:05,953 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:52:05,954 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-02-15 10:52:05,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:05,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:05,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:05,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:52:06,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:06,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:06,065 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:52:06,066 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-15 10:52:06,067 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:52:06,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:52:06,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:52:06,071 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. [2019-02-15 10:52:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:06,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:52:06,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:06,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:06,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:06,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:06,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,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 [2019-02-15 10:52:06,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:52:06,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:52:06,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,214 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 [2019-02-15 10:52:06,217 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 [2019-02-15 10:52:06,219 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 [2019-02-15 10:52:06,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:52:06,222 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:06,273 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 10:52:06,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,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 [2019-02-15 10:52:06,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:06,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:52:06,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:52:06,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:06,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 10:52:06,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,393 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:06,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:52:06,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:06,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 10:52:06,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:06,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 89 [2019-02-15 10:52:06,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:06,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:06,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 10:52:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:06,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:06,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:06,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:52:06,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:06,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:52:06,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:52:06,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:52:06,613 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-02-15 10:52:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:07,426 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-02-15 10:52:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:52:07,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 10:52:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:07,430 INFO L225 Difference]: With dead ends: 110 [2019-02-15 10:52:07,430 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 10:52:07,430 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 [2019-02-15 10:52:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 10:52:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-02-15 10:52:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:52:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-15 10:52:07,533 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-02-15 10:52:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:07,533 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-15 10:52:07,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:52:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-15 10:52:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:52:07,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:07,534 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:52:07,534 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:07,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:07,534 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-02-15 10:52:07,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:07,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:07,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-15 10:52:07,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:07,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:07,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:07,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:07,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:07,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:07,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:07,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:07,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:07,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:07,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:07,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 10:52:07,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 10:52:07,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 10:52:07,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,783 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 [2019-02-15 10:52:07,785 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 [2019-02-15 10:52:07,787 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 [2019-02-15 10:52:07,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 10:52:07,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,804 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,813 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,821 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,839 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 10:52:07,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 10:52:07,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:07,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 10:52:07,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:52:07,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:07,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-02-15 10:52:07,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:07,972 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:07,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 10:52:07,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:07,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:07,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-02-15 10:52:08,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,021 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:52:08,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 10:52:08,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:08,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:08,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-02-15 10:52:08,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:52:08,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2019-02-15 10:52:08,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:08,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:52:08,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-15 10:52:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:08,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:08,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:08,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 10:52:08,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:08,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:52:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:52:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:52:08,222 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-02-15 10:52:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:08,698 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-02-15 10:52:08,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:52:08,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 10:52:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:08,699 INFO L225 Difference]: With dead ends: 32 [2019-02-15 10:52:08,699 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 10:52:08,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:52:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 10:52:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 10:52:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 10:52:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 10:52:08,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-02-15 10:52:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:08,702 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 10:52:08,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:52:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 10:52:08,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 10:52:08,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 10:52:08,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:08,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:08,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:09,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:10,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:10,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:12,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:13,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:13,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:17,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:52:19,417 WARN L181 SmtUtils]: Spent 10.70 s on a formula simplification. DAG size of input: 1504 DAG size of output: 1059 [2019-02-15 10:52:35,774 WARN L181 SmtUtils]: Spent 16.35 s on a formula simplification. DAG size of input: 996 DAG size of output: 75 [2019-02-15 10:52:35,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-15 10:52:35,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-02-15 10:52:35,778 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-02-15 10:52:35,778 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-15 10:52:35,779 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse16 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse3 1)))) (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse15 (select .cse16 ULTIMATE.start_main_p1)) (.cse2 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1)))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse17 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse9 (= 0 .cse15)) (.cse5 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse18 (= 0 (select .cse16 ULTIMATE.start_main_p2))) (.cse7 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse1 (- 1))))) (let ((.cse13 (and .cse0 .cse17 .cse4 .cse9 .cse5 .cse18 (<= 1 (select .cse7 ULTIMATE.start_main_p3)))) (.cse12 (select .cse10 ULTIMATE.start_main_p3)) (.cse14 (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse1 0) (<= .cse2 0) (= .cse3 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) .cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse5 (<= 0 .cse6)) (and .cse4 (let ((.cse8 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (= 0 (select .cse7 ULTIMATE.start_main_p2)) (<= 1 (select .cse7 ULTIMATE.start_main_p1))) (and .cse8 (and .cse9 .cse0)) (and (<= 1 (select .cse10 ULTIMATE.start_main_p1)) .cse8))) (<= .cse1 0) (<= 0 .cse12)) (and .cse13 .cse14) (and .cse13 (= .cse15 (select .cse16 ULTIMATE.start_main_p4))) (and (and .cse17 .cse9 (= 0 .cse12) .cse18) .cse14))))))) [2019-02-15 10:52:35,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-15 10:52:35,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-15 10:52:35,779 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-02-15 10:52:35,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-15 10:52:35,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-15 10:52:35,780 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-02-15 10:52:35,798 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:52:35 BoogieIcfgContainer [2019-02-15 10:52:35,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 10:52:35,799 INFO L168 Benchmark]: Toolchain (without parser) took 93312.55 ms. Allocated memory was 140.0 MB in the beginning and 946.3 MB in the end (delta: 806.4 MB). Free memory was 106.2 MB in the beginning and 424.2 MB in the end (delta: -318.0 MB). Peak memory consumption was 801.8 MB. Max. memory is 7.1 GB. [2019-02-15 10:52:35,803 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:52:35,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.91 ms. Allocated memory is still 140.0 MB. Free memory was 105.8 MB in the beginning and 103.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-15 10:52:35,806 INFO L168 Benchmark]: Boogie Preprocessor took 29.34 ms. Allocated memory is still 140.0 MB. Free memory was 103.7 MB in the beginning and 102.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 10:52:35,806 INFO L168 Benchmark]: RCFGBuilder took 455.62 ms. Allocated memory is still 140.0 MB. Free memory was 102.4 MB in the beginning and 92.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-02-15 10:52:35,806 INFO L168 Benchmark]: TraceAbstraction took 92757.49 ms. Allocated memory was 140.0 MB in the beginning and 946.3 MB in the end (delta: 806.4 MB). Free memory was 92.0 MB in the beginning and 424.2 MB in the end (delta: -332.2 MB). Peak memory consumption was 787.5 MB. Max. memory is 7.1 GB. [2019-02-15 10:52:35,809 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.91 ms. Allocated memory is still 140.0 MB. Free memory was 105.8 MB in the beginning and 103.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.34 ms. Allocated memory is still 140.0 MB. Free memory was 103.7 MB in the beginning and 102.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 455.62 ms. Allocated memory is still 140.0 MB. Free memory was 102.4 MB in the beginning and 92.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92757.49 ms. Allocated memory was 140.0 MB in the beginning and 946.3 MB in the end (delta: 806.4 MB). Free memory was 92.0 MB in the beginning and 424.2 MB in the end (delta: -332.2 MB). Peak memory consumption was 787.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: 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: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: 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 == 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]) || (((!(p3 == p4) && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) || (#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))) && #memory_int[p4] <= 0) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p3])) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p3 := #memory_int[p3] + 1][p1] == #memory_int[p3 := #memory_int[p3] + 1][p4])) || ((((!(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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 92.6s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 27.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.0s 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.4s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 352 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4079744448 FormulaSimplificationTreeSizeReduction, 10.7s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39947544 FormulaSimplificationTreeSizeReductionInter, 16.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 35.5s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91459 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...